160 likes | 303 Views
G = (V, E). a vertex may have: 0 or more predecessors 0 or more successors. . . . . . . . . . . . . . . some problems that can be represented by a graph. computer networksairline flightsroad mapcourse prerequisite structuretasks for completing a jobflow of control through a programmany mor
E N D