Package networkx :: Package generators :: Module atlas
[hide private]
[frames] | no frames]

Module atlas

source code

Generators for the small graph atlas.

See "An Atlas of Graphs" by Ronald C. Read and Robin J. Wilson, Oxford University Press, 1998.

Because of its size, this module is not imported by default.




Date: $Date: 2005-03-30 16:56:28 -0700 (Wed, 30 Mar 2005) $

Author: Pieter Swart (swart@lanl.gov)

Functions [hide private]
 
graph_atlas_g()
Return the list [G0,G1,...,G1252] of graphs as named in the Graph Atlas.
source code
 
_test_suite()
test hook
source code
Variables [hide private]
  __credits__ = ''
  __revision__ = '$Revision: 911 $'
Function Details [hide private]

graph_atlas_g()

source code 

Return the list [G0,G1,...,G1252] of graphs as named in the Graph Atlas. G0,G1,...,G1252 are all graphs with up to 7 nodes.

The graphs are listed:
  1. in increasing order of number of nodes;
  2. for a fixed number of nodes, in increasing order of the number of edges;
  3. for fixed numbers of nodes and edges, in increasing order of the degree sequence, for example 111223 < 112222;
  4. for fixed degree sequence, in increasing number of automorphisms.

Note that indexing is set up so that for GAG=graph_atlas_g(), then G123=GAG[123] and G[0]=empty_graph(0)