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)).

In particular, it computes candidates of relevant cycle familes.

Definitions

origin : ISubgraph o k e n -> NCycle o -> NCycle k

Totality: total
Visibility: export

componentCandidates : Subgraph k e n -> Candidates k e

  Computes the potential relevant cycle familes for a biconnected
  component of a graph.

Totality: total
Visibility: export

candidates : IGraph k e n -> List (Candidates k e)

  Cuts a graph into strongly connected components and computes
  the potential relevant cycle families for each component in
  isolation.

Totality: total
Visibility: export