Short Answers Section 14.1 Graph Definitions |
Short Answers
Section 14.2
Graph Implementations
0 1 2 3 0 | true false true false | 1 | true false false false | 2 | false false false true | 3 | true false true false |
Short Answers
Section 14.3-14.4
Graph Traversals
and Path Algorithms
v0 <------- v2 / \ / \ -> v1 <-/ \-> v4 / \ / \ / \->v3 -------> v5 / / / / v6 <---------/In what order are the vertices visited for a depth-first search that starts at v0? In what order are the vertices visited for a breadth-first search that starts at v0?
Multiple Choice Section 14.1 Graph Definitions |
Multiple Choice
Section 14.2
Graph Implementations
Multiple Choice
Section 14.3-14.4
Graph Traversals
and Path Algorithms