題組內容

6.(26%) For a graph G = (V, E), V={1,2,3, 4, 5,6,7}, E={(1,2),(2,3),(3, 4),(1,5),(2,5), (1,6), (1,7), (5, 4), (6, 7)}, and the cost for above edges are {11, 5, 12, 18, 20, 6, 11, 14, 23} , respectively.

(6%) (C) Starting from node 1, use Depth First Search (DFS) and Breadth First Search (BFS) to determine the minimum spanning tree of graph G.