Saved Bookmarks
| 1. |
How Kruskal's Algorithm Works? |
|
Answer» This ALGORITHM treats the graph as a forest and every node it as an individual TREE. A tree CONNECTS to another only and only if it has LEAST cost among all available options and does not violate MST PROPERTIES. This algorithm treats the graph as a forest and every node it as an individual tree. A tree connects to another only and only if it has least cost among all available options and does not violate MST properties. |
|