Data.Graph.Connectivity

For Connectivity analisis purposes a DGraph can be converted into a | UGraph using toUndirected

Documentation

isConnected :: UGraph v e -> Bool

Tell if a UGraph is connected | An Undirected Graph is connected when there is a path between every pair | of vertices

isDisconnected :: UGraph v e -> Bool

Tell if a UGraph is disconnected | An Undirected Graph is disconnected when its not connected. See | isConnected TODO: An edgeles graph with two or more vertices is disconnected

areConnected :: UGraph v e -> v -> v -> Bool

Tell if two vertices of a UGraph are connected | Two vertices are connected if it exists a path between them

areDisconnected :: UGraph v e -> v -> v -> Bool

Tell if two vertices of a UGraph are disconnected | Two vertices are disconnected if it doesn't exist a path between them

unreachableVertices :: UGraph v e -> [v]

Retrieve all the unreachable vertices of a UGraph | The unreachable vertices are those with no adjacent Edges

isWeaklyConnected :: DGraph v e -> Bool

Tell if a DGraph is weakly connected | A Directed Graph is weakly connected if the equivalent undirected graph | is connected

connected component

strong components

vertex cut

vertex connectivity

bridge

edge-connectivity

maximally connected

maximally edge-connected

super-connectivity

hyper-connectivity

Menger's theorem