FundamentalCycle takes as input a graph G with a unique cycle and outputs the unique cycle as a graph. If G has more than one cycle an error is returned.
G ≔ Graph⁡Trail⁡1,2,3,4,5,2,6
G≔Graph 1: an undirected unweighted graph with 6 vertices and 6 edge(s)
C ≔ FundamentalCycle⁡G
C≔Graph 2: an undirected unweighted graph with 4 vertices and 4 edge(s)
Graph 1: an undirected unweighted graph with 6 vertices and 5 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)