Package indexed-graph - Namespaces

• Data.AssocList.Indexed
• Data.Graph.Indexed
• Data.Graph.Indexed.Subgraph
• Data.Graph.Indexed.Types

  A representation for sparse, simple, undirected labeled graphs, indexed by their order and backed by an immutable array for fast O(1) node lookups.
• Data.Graph.Indexed.Util
• Data.Graph.Indexed.Query.BFS
• Data.Graph.Indexed.Query.DFS

  This modules provides several functions for traversing graphs in depth-first order and accumulating results in various ways along the way.
• Data.Graph.Indexed.Query.Subgraph

  This is an implementation of a simple but efficient subgraph isomorphism algorithm.
• Data.Graph.Indexed.Query.Visited
• Data.Graph.Indexed.Query.Util

  Utilities for graph traversals.
• Data.Graph.Indexed.Ring.Relevant
• Data.Graph.Indexed.Ring.Relevant.Candidates

  This module provides utilities used to compute families of relevant cycles as described by Vismara et al in "Union of all the minimum cycle bases of a graph" (The Electronic Journal of Combinatorics 4 (1997)).
• Data.Graph.Indexed.Ring.Relevant.ShortestPath

  This module provides utilities used to compute families of relevant cycles as described by Vismara et al in "Union of all the minimum cycle bases of a graph" (The Electronic Journal of Combinatorics 4 (1997)).
• Data.Graph.Indexed.Ring.Relevant.Types
• Data.Graph.Indexed.Ring.Bonds
• Data.Graph.Indexed.Ring.Systems

  Computes the ring systems (biconnected components) of a graph and provides an efficient mapping assigning each node to the ring system it belongs to.
• Data.Graph.Indexed.Ring.Util
• Data.Graph.Indexed.Util.Bipartite
• Data.Graph.Indexed.Util.DisjointSet