Revision history [back]
 | 1 | initial version |
All graphs in Sage support iteration over its major subcomponents, at least vertices and to create a graph from its adjacency matrix
mg= Graph(adj) mg.is_isomorphic(mg) -> True
# graph from adjency matrix
adj= Matrix ([ [0, 1, 1], [1, 0, 1], [1, 1, 0] ])
mg= Graph(adj)
mg.is_isomorphic(mg) -> True
If are you looking for the isomorphic subgraphs of the one you specify with the adj. graph you can usemg.subgraph_search_iterator().
too see how it might be used here. If you post the source as suggested above we could get a more detailed answer.
Here is a simple example of looking for the simplest graph, with zero vertices:
eg = Graph()
[p for p in mg.subgraph_search_iterator(eg)]
