What is a spanning Tree?
Page 1 of 1
What is a spanning Tree?
Admin Sun Jan 31, 2010 7:24 am
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.
30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
No.
Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
No.
Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
Admin- Admin
- Posts : 71
Join date : 2010-01-21 -
Similar topics» 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?
» There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
» Of the following tree structure, which is, efficient considering space and time complexities?
» List out few of the Application of tree data-structure?
» In tree construction which is the suitable efficient data structure?
» There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
» Of the following tree structure, which is, efficient considering space and time complexities?
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum|
|
|