1. Using the undirected graph above, list the order of nodes that would be visited by... a. depth-first search starting at node "6". b. breadth-first search starting at node "6". (note: in both cases, there are multiple solutions) 2. For the weighted graph above, what edges are in... a. the shortest path between nodes "1" and "6"? b. the shortest path tree from node "1" to all other nodes? c. the minimal spanning tree? 3. For the weighted directed graph above, what edges are in... a. the shortest path from node "E" to "A"? b. the minimal branching rooted at "E"? 4. For the flow network above (the numbers are capacities)... a. find the max flow from s to u. b. find the max flow from s to v. c. find the max flow from s to t. |