問題詳情

【題組】(6%)
(C) Starting from node 1, use Depth First Search (DFS) and Breadth First Search (BFS) todetermine the minimum spanning tree of graph G.

參考答案