Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- getShortestPath :: Graph d v e -> Node -> Node -> [Node]
- inducedSubgraph :: (Ord v, Serialize v) => Graph d v e -> [Int] -> Graph d v e
- isConnected :: Graph d v e -> Bool
- isStronglyConnected :: Graph D v e -> Bool
- decompose :: (Ord v, Serialize v) => Graph d v e -> [Graph d v e]
- isDag :: Graph d v e -> Bool
- topSort :: Graph d v e -> [Node]
- topSortUnsafe :: Graph d v e -> [Node]
Shortest Path Related Functions
isConnected :: Graph d v e -> Bool Source #
Decides whether the graph is weakly connected.
decompose :: (Ord v, Serialize v) => Graph d v e -> [Graph d v e] Source #
Decompose a graph into connected components.
isDag :: Graph d v e -> Bool Source #
Checks whether a graph is a directed acyclic graph (DAG) or not.
topSortUnsafe :: Graph d v e -> [Node] Source #
Calculate a possible topological sorting of the graph. If the graph is not acyclic (it has at least one cycle), a partial topological sort is returned.