Data Structures Notes
Showing posts with label
Spanning Tree
.
Show all posts
Showing posts with label
Spanning Tree
.
Show all posts
Monday, March 30, 2009
Prim-Jarnik's algorithm for extracting Minimum Spanning Tree (MST)
›
This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...
Kruskal's algorithm for extracting Minimum Spanning Tree (MST)
›
This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...
Spanning Tree & Minimum Spanning Tree (MST)
›
Spanning Tr ee - A tree that contains every vertex of a connected graph G is referred to as a spanning tree. The below figure depicts the Fi...
›
Home
View web version
