HGraph.Directed.Packing.Cycles.Internal

Documentation

arcMaximumI :: (DirectedGraph t, Adjacency t, Mutable t) => t Int -> ([[Int]], Int)

A packing of pairwise arc-disjoint cycles of maximum size.

maximum :: (DirectedGraph t, Mutable t, Adjacency t) => t a -> ([[a]], Int)

Computes a packing of pairwise disjoint cycles of maximum size.

maximumI :: (DirectedGraph t, Mutable t, Adjacency t) => t Int -> ([[Int]], Int)

Computes a packing of pairwise disjoint cycles of maximum size. Vertices of the input digraph must be labeled with integers from `0` to `n - 1`.

maximumI' :: (DirectedGraph t, Adjacency t, Mutable t) => t Int -> Int -> Maybe ([[Int]], Int)

maximumIWeak :: (DirectedGraph t, Adjacency t, Mutable t) => t Int -> Int -> Maybe ([[Int]], Int)

guessArc :: (DirectedGraph t, Adjacency t, Mutable t) => t Int -> Int -> (Int, Int) -> Maybe ([[Int]], Int)

packArc :: (DirectedGraph t, Mutable t, Adjacency t) => t Int -> Int -> [Int] -> Int -> (Int, Int) -> Maybe ([[Int]], Int)