haskell-igraph-0.7.0: Haskell interface of the igraph library.

Safe HaskellNone
LanguageHaskell2010

IGraph.Algorithms.Structure

Contents

Synopsis

Shortest Path Related Functions

getShortestPath Source #

Arguments

:: Graph d v e 
-> Node

The id of the source vertex.

-> Node

The id of the target vertex.

-> [Node] 

inducedSubgraph :: (Ord v, Serialize v) => Graph d v e -> [Int] -> Graph d v e Source #

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.

topSort :: Graph d v e -> [Node] Source #

Calculate a possible topological sorting of the graph.

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.