Minimum spanning tree.
Download as PPTX, PDF0 likes79 views
A minimum spanning tree is a subgraph of a weighted connected graph that is a tree containing all the vertices with no circuits, and has the minimum or smallest total weight among all the possible spanning trees of that graph.
1 of 6
Download to read offline
Minimum spanning tree.
- 2. Spanning A spanning tree of a graph is subgraph which is basically a tree and it contains all the vertices of graph containg no circuit.
- 3. Minimum spanning tree A minimum spanning tree of a weighted connected graph is a spanning tree with minimum or smallest weigh.
- 4. Example