isspantree (biograph)
(Removed) Determine if tree created from biograph object is spanning tree
The function has been removed. A graph is a spanning tree if and only if all nodes are
reachable from an arbitrary start node, and E ==
N-1
, where E is the number of
edges and N is the number of nodes. You can use either bfsearch
or dfsearch
to check if such conditions
are true for a given graph.
Syntax
TF
= isspantree(BGObj
)
Description
Tip
For introductory information on graph theory functions, see Graph Theory Functions.
returns logical 1 (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.
References
[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).