Math.Grads.Algo.Cycles

Module that provides functions for analysis of graph's cycles.

Documentation

findCycles :: Ord e => EdgeList e -> [EdgeList e]

Takes EdgeList and finds non-redundant set of conjugated simple cycles. Cycles sharing in common one edge are considered to be one cycle. BondList must obey rule (b, e, _) b < e.

findSimpleCycles :: Eq e => EdgeList e -> [EdgeList e]

Finds all simple cycles in fused cycles system.

findLocalCycles :: Eq e => EdgeList e -> [EdgeList e]

Finds all cycles of minimal length contained in system of conjugated cycles.

getCyclic :: GenericGraph v e -> Set Int

Returns the set of all vertices which belong to any cycle.

isEdgeInCycle :: Ord e => EdgeList e -> Int -> Bool

Checks that edge with given index in EdgeList is contained in any cycle.