セクション 3. 章 4
single
Prim's MST
メニューを表示するにはスワイプしてください
This algorithm is another one approach to find the MST - minimum spanning tree. The main idea is to partition a set of vertices into two: included to MST already and excluded. Step by step you’ll replace vertices from the second set to the first by picking the less weighted edge that connects both sets.
So algorithm is next:
- Put the start vertex to the
visited, the rest will beunvisited, i. e. in the second set. - Start adding vertices. Visit all neighbors for all visited vertices and select the edge with least weight, that does not create a cycle. Mark the adjacent vertex as
visited. - Do the 2) until all vertices are visited.
You can find a lot of different implementations, but the main idea is to put all vertices into the visited set step by step.
タスク
スワイプしてコーディングを開始
Complete the primMST() algorithm inside Graph class. Init the graph and call this method. To detect a cycle, use BFS() or DFS() algorithms. You can implement it inside the class.
解答
実践的な練習のためにデスクトップに切り替える下記のオプションのいずれかを利用して、現在の場所から続行するすべて明確でしたか？
フィードバックありがとうございます！
セクション 3. 章 4
single
AIに質問する
AIに質問する
何でも質問するか、提案された質問の1つを試してチャットを始めてください
