algorithm - Trying to create an algo that creates a spanning tree with least number of edges removed from a unweighed graph -
i trying create algo spanning tree root node such that, spanning tree have least number of edges removed original graph g.
thanks in advance
for connected graph, spanning tree contains n-1 edges n number of nodes in graph. have remove remaining edges. (if have understood question correctly)
even disconnected graphs, number of edges in spanning tree defined number of components , number of nodes in each component.
Comments
Post a Comment