graphite-0.0.1.0: Graphs and networks library

Data.Graph.Connectivity

Description

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

Synopsis

# Documentation

isConnected :: Graph v e -> Bool Source #

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

isDisconnected :: Graph v e -> Bool Source #

Tell if a Graph 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 :: Graph v e -> v -> v -> Bool Source #

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

areDisconnected :: Graph v e -> v -> v -> Bool Source #

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

unreachableVertices :: Graph v e -> [v] Source #

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

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