Class Hierarchy

• networkx.queues.Priority
• object: The most base type
  • networkx.isomorphvf2.GraphMatcher: A GraphMatcher is responsible for matching undirected graphs (Graph or XGraph) in a predetermined manner.
  • list: list() -> new list list(sequence) -> new list initialized from sequence's items
    • networkx.queues.LIFO
      • networkx.queues.DFS: Depth first search queue
    • networkx.queues.FIFO
      • networkx.queues.BFS: Breadth first search queue
    • networkx.queues.Random
      • networkx.queues.RFS: Random search queue
  • exceptions.BaseException: Common base class for all exceptions
    • exceptions.Exception: Common base class for all non-exit exceptions.
      • networkx.exception.NetworkXException: Base class for exceptions in NetworkX.
        • networkx.exception.NetworkXError: Exception for a serious error in NetworkX
  • networkx.graph.Graph: Graph is a simple graph without any multiple (parallel) edges or self-loops.
    • networkx.tree.Tree: A free (unrooted) tree.
      • networkx.tree.DirectedTree: A directed tree.
      • networkx.tree.DirectedForest
      • networkx.tree.Forest: A forest.
      • networkx.tree.RootedTree: A rooted tree.
    • networkx.digraph.DiGraph: A graph with directed edges.
      • networkx.tree.DirectedTree: A directed tree.
      • networkx.tree.DirectedForest
      • networkx.xdigraph.XDiGraph: Digraphs with (optional) self-loops, (optional) multiple edges, arbitrary (hashable) objects as nodes, and arbitrary objects associated with edges.
    • networkx.tree.Forest: A forest.
    • networkx.xgraph.XGraph: A class implementing general undirected graphs, allowing (optional) self-loops, multiple edges, arbitrary (hashable) objects as nodes and arbitrary objects associated with edges.
    • networkx.tree.RootedTree: A rooted tree.
  • networkx.search_class.Search: Generic graph traversal (search) class.
    • networkx.search_class.Preorder: Preorder visitor Builds a list of nodes in preorder of search.
    • networkx.search_class.Postorder: Postorder visitor Builds a list of nodes in postorder of search.
    • networkx.search_class.Successor: Successor visitor Builds a dict of nodes with sucessor vertex list as data.
    • networkx.search_class.Predecessor: Predeceessor visitor Builds a dict of nodes with sucessor vertex list as data.
    • 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.isomorphvf2.GMState: This class is used internally by the GraphMatcher class.
  • networkx.tests.benchmark.Benchmark: Benchmark a method or simple bit of code using different Graph classes.
  • networkx.isomorphvf2.DiGMState: This class is used internally by the DiGraphMatcher class.
  • networkx.isomorphvf2.DiGraphMatcher: A DiGraphMatcher is responsible for matching directed graphs (DiGraph or XDiGraph) in a predetermined manner.