|
GraphTheory[SpanningTree]
|
|
Calling Sequence
|
|
SpanningTree(G)
SpanningTree(G, r)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected graph
|
|
r
|
-
|
vertex of the graph
|
|
|
|
|
|
Description
|
|
|
•
|
The SpanningTree command returns a spanning tree of G, a subgraph that contains all the vertices and is a tree. Edge weights are ignored.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (4) |
|
>
|
|
|
| (5) |
|
|
Download Help Document
Was this information helpful?
