Revision history [back]
 | 1 | initial version |
The following is an alternative solution (using networkx).
import networkx as nx
G=graphs.PetersenGraph()
NG = G.networkx_graph()
sorted(nx.simple_cycles(NG))| | 1 | initial version |
The following is an alternative solution (using networkx).
import networkx as nx
G=graphs.PetersenGraph()
NG = G.networkx_graph()
sorted(nx.simple_cycles(NG))
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.