Class Hierarchy

• graph.algorithms.utils.HeapItem
• object: The most base type
  • exceptions.BaseException: Common base class for all exceptions
    • exceptions.Exception: Common base class for all non-exit exceptions.
      • exceptions.StandardError: Base class for all standard Python exceptions that do not represent interpreter exiting.
        • exceptions.RuntimeError: Unspecified run-time error.
          • graph.algorithms.exceptions.python_graph_exception: A base-class for the various kinds of errors that occur in the the python-graph class.
            • graph.algorithms.exceptions.unreachable: Goal could not be reached from start.
  • graph.algorithms.heuristics.Chow.chow: An implementation of the graph searching heuristic proposed by Edmond Chow.
  • graph.classes.Digraph.digraph: Digraph class.
  • graph.algorithms.heuristics.Euclidean.euclidean: A* heuristic for Euclidean graphs.
  • graph.algorithms.filters.Find.find: Search filter for finding a specific node.
  • graph.classes.Graph.graph: Graph class.
  • graph.classes.Hypergraph.hypergraph: Hypergraph class.
  • graph.algorithms.filters.Null.null: Null search filter.
  • graph.algorithms.filters.Radius.radius: Radial search filter.
• graph.algorithms.utils.priority_queue: Priority queue.