Football
========

Consider a graph where the vertices represent BCS college football
teams, and there is an edge from x to y if team x defeated team y during
the 2014 season. Only six of the 128 teams are shown.

    UMass --> Ball St  --> CMU 
                     ^      |
                       \    v
    Notre <-- North <-- N. Illinoin
    Dame      western


Football
========

Consider a graph where the vertices represent BCS college football
teams, and there is an edge from x to y if team x defeated team y during
the 2014 season.

In this graph, what does the number of edges into the vertex for team x
represent? (Teams do not play one another more than once.)

a.  x's number of wins
b.  *x's number of losses*
c.  x's number of total games
d.  x's net wins (wins minus losses)

`getNeighbors` runtime
======================

Suppose we have a graph of n vertices, and each vertex has at most d
edges out of it. What is the worst-case running time of the
`getNeighbors` method?

a.  O(d)
b.  O(nd)
c.  O(1)
d.  *O(n)*

`isPath`
========

If we test `isPath(N. Illinois, UMass)`, how many vertices will be
marked when the method finishes? 

a. 3 
b. 4 
c. *5*
d. 6