Revision history [back]
 | 1 | initial version |
How about this:
sage: g = graphs.HigmanSimsGraph()
sage: g.*path*?
g.add_path
g.all_paths
g.disjoint_routed_paths
g.edge_disjoint_paths
g.interior_paths
g.longest_path
g.shortest_path
g.shortest_path_all_pairs
g.shortest_path_length
g.shortest_path_lengths
g.shortest_paths
g.vertex_disjoint_paths
sage: g.*path?
g.add_path
g.longest_path
g.shortest_path
