[frames | no frames]

## Module Hierarchy

- `networkx`: NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
  - `base`: Base classes for graphs and digraphs.
  - `centrality`: Centrality measures.
  - `cliques`: Cliques - Find and manipulate cliques of graphs
  - `cluster`: Compute clustering coefficients and transitivity of graphs.
  - `cores`: Find and manipulate the k-cores of a graph
  - `drawing`
    - `layout`: Layout (positioning) algorithms for graph drawing.
    - `nx_pydot`: Import and export networkx networks to dot format using pydot.
    - `nx_pylab`: Draw networks with matplotlib/pylab.
    - `nx_vtk`: Draw networks in 3d with vtk.
  - `generators`: A package for generating various graphs in networkx.
    - `atlas`: Generators for the small graph atlas.
    - `classic`: Generators for some classic graphs.
    - `degree_seq`: Generate graphs with a given degree sequence.
    - `geometric`: Generators for geometric graphs.
    - `random_graphs`: Generators for random graphs
    - `small`: Various small and named graphs, together with some compact generators.
  - `hybrid`: Hybrid
  - `io`: Read and write graphs and networks.
  - `isomorph`: Fast checking to see if graphs are not isomorphic.
  - `operators`: Operations on graphs; including union, complement, subgraph.
  - `paths`: Shortest paths, diameter, radius, eccentricity, and related methods.
  - `queues`: Helper queues for use in graph searching.
  - `release`: Release data for NetworkX.
  - `search`: Search algorithms, shortest path, spanning trees, etc.
  - `search_class`: Graph search classes
  - `spectrum`: Laplacian, adjacency matrix, and spectrum of graphs.
  - `threshold`: Threshold Graphs - Creation, manipulation and identification.
  - `utils`: Utilities for networkx package
  - `xbase`: Methods for general graphs (XGraph) and digraphs (XDiGraph) allowing self-loops, multiple edges, arbitrary (hashable) objects as nodes and arbitrary objects associated with edges.

## Class Hierarchy

- `__builtin__.object`: The most base type
  - `networkx.base.Graph`: Graph is a simple graph without any multiple (parallel) edges or self-loops.
    - `networkx.base.DiGraph`: A graph with directed edges.
      - `networkx.xbase.XDiGraph`: A class implementing general undirected digraphs, allowing (optional) self-loops, multiple edges, arbitrary (hashable) objects as nodes and arbitrary objects associated with edges.
    - `networkx.xbase.XGraph`: A class implementing general undirected graphs, allowing (optional) self-loops, multiple edges, arbitrary (hashable) objects as nodes and arbitrary objects associated with edges.
  - `__builtin__.list`: list() -> new list list(sequence) -> new list initialized from sequence's items
    - `networkx.queues.FIFO`
      - `networkx.queues.BFS`: Breadth first search queue
    - `networkx.queues.LIFO`
      - `networkx.queues.DFS`: Depth first search queue
    - `networkx.queues.Random`
      - `networkx.queues.RFS`: Random search queue
  - `networkx.search_class.Search`: Generic graph traversal (search) class.
    - `networkx.search_class.Forest`: Forest visitor: build a forest of trees as a list of networkx DiGraphs.
    - `networkx.search_class.Length`: Path length visitor.
    - `networkx.search_class.Postorder`: Postorder visitor Builds a list of nodes in postorder of search.
    - `networkx.search_class.Predecessor`: Predeceessor visitor Builds a dict of nodes with sucessor vertex list as data.
    - `networkx.search_class.Preorder`: Preorder visitor Builds a list of nodes in preorder of search.
    - `networkx.search_class.Successor`: Successor visitor Builds a dict of nodes with sucessor vertex list as data.
  - `__builtin__.type`: type(object) -> the object's type type(name, bases, dict) -> a new type
- `exceptions.Exception`: Common base class for all exceptions.
  - `networkx.base.NetworkXException`: Base class for exceptions in NetworkX.
    - `networkx.base.NetworkXError`: Exception for a serious error in NetworkX
- `networkx.queues.Priority`

Generated by Epydoc 2.1 on Sun Aug 21 08:06:59 2005 | http://epydoc.sf.net