Math.Grads.Algo.Paths

Module that provides functions for different kinds of path-finding in graph.

Documentation

allPathsInGraph :: Ord e => GenericGraph v e -> Int -> [EdgeList e]

Calculates all branched paths in graph up to the given length.

allPathsFromVertex :: Ord e => GenericGraph v e -> Int -> Int -> [Int] -> [EdgeList e]

Calculates all branched paths up to the given length from given vertex in graph considering indices of vertices that shouldn't be visited during path-finding.

dfsAllPaths :: EdgeList e -> Int -> Int -> [EdgeList e]

Finds all paths between vertices with given indices in EdgeList.

dfsSearch :: EdgeList e -> Int -> Int -> Maybe (EdgeList e, [Int])

Finds path between two vertices in graph represented as EdgeList. Graph shouldn't have any cycles. Hmmm, what's the difference between this function and DFS or BFS?..

findBeginnings :: EdgeList e -> [Int]

Finds all vertices in EdgeList that have only one neighbour.