Min. Spanning Tree: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5910:59, 10 October 2022‎ Admin talk contribs‎ 2,703 bytes +2,703‎ Created page with "== Problem Description== The cost of the spanning tree is the sum of the weights of all the edges in the tree. There can be many spanning trees. Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees. There also can be many minimum spanning trees. Minimum spanning tree has direct application in the design of networks. It is used in algorithms approximating the travelling salesman problem, multi-terminal minimum cut problem and..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Min._Spanning_Tree"