Kwik Data Structure and algorithm
Wednesday, 22 June 2016
How many spanning trees can a graph has?
It depends on how connected the graph is. A complete undirected graph can have maximum n
n-1
number of spanning trees, where n is number of nodes.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment