Determine if tree created from biograph object is spanning tree
TF = isspantree(BGObj)
Tip
For introductory information on graph theory functions, see Graph Theory Functions.
TF = isspantree(BGObj)true) if the N-by-N adjacency matrix
extracted from a biograph object, BGObj,
is a spanning tree, and logical 0 (false) otherwise.
A spanning tree must touch all the nodes and must be acyclic. The
lower triangle of the N-by-N adjacency matrix represents an undirected
graph, and all nonzero entries indicate the presence of an edge.
Note
The function ignores the direction of the edges in the Biograph object.
[1] Siek, J.G., Lee, L-Q, and Lumsdaine, A. (2002). The Boost Graph Library User Guide and Reference Manual, (Upper Saddle River, NJ:Pearson Education).
allshortestpaths | biograph | conncomp | graphisspantree | isdag | isomorphism | maxflow | minspantree | shortestpath | topoorder | traverse