finds the cycle in a unicyclic undirected graph
graph or network
set of edges of G
Important: The networks package has been deprecated. Use the superseding command GraphTheory[CycleBasis] instead.
Given a subset e of edges forming a unicyclic subgraph of a graph G, the edges forming the unique cycle are returned as a set. It is assumed that only one cycle is present.
If no cycle exists then the empty set is returned.
When a spanning tree is known, fundcyc allows one to extract the fundamental cycles of a cycle basis by adding one edge at a time to the tree.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[fundcyc](...).
G ≔ complete⁡4:
sptree ≔ edges⁡spantree⁡G
e ≔ op⁡1,edges⁡G∖sptree
Download Help Document
What kind of issue would you like to report? (Optional)