|
networks[cyclebase] - finds a cycle basis in an undirected graph
|
|
Calling Sequence
|
|
cyclebase(G)
|
|
|
Description
|
|
|
•
|
A spanning tree is found, and fundcyc() is then used to find all fundamental cycles with respect to this tree. They are returned as a set of cycles with each cycle being represented by a set of edges.
|
|
•
|
The subgraphs corresponding to these cycles can be constructed using induce().
|
|
•
|
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[cyclebase](...).
|
|
|
Download Help Document
Was this information helpful?
