Please enable JavaScript.
Coggle requires JavaScript to display documents.
Greedy Technique - Coggle Diagram
Greedy Technique
Prim's Algorithm
-
Need to attach to every vertex the name of the nearest tree vertex and the weight of the corresponding edge.
Can consider the vertices adjacent to the tree as fringe vertices, then pick the one with the smallest weight.
-
-
Kruskal's Algorithm
Constructs a minimum spanning tree as an expanding sequence of subgraphs that are always acyclic but are not necessarily connected on the intermediate stages of the algorithm.
-
Since there's a need to check if each connection is going to generate a cycle, there's the need of untion-find algorithms.
-
-