A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
Similar topics
» Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
» In an AVL tree, at what condition the balancing is to be done?
» List out few of the Application of tree data-structure?
» In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)
» In an AVL tree, at what condition the balancing is to be done?
» List out few of the Application of tree data-structure?
» In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)
Permissions in this forum:
You cannot reply to topics in this forum
|
|
|