Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
For Connectivity analisis purposes a DGraph
can be converted into a
| 'UGraph using toUndirected
- isConnected :: UGraph v e -> Bool
- isDisconnected :: UGraph v e -> Bool
- areConnected :: UGraph v e -> v -> v -> Bool
- areDisconnected :: UGraph v e -> v -> v -> Bool
- unreachableVertices :: UGraph v e -> [v]
- isWeaklyConnected :: DGraph v e -> Bool
Documentation
isConnected :: UGraph v e -> Bool Source #
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 Source #
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 Source #
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 Source #
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] Source #
Retrieve all the unreachable vertices of a 'UGraph
| The unreachable vertices
are those with no adjacent Edge
s
isWeaklyConnected :: DGraph v e -> Bool Source #
Tell if a DGraph
is weakly connected
| A Directed Graph is weakly connected
if the equivalent undirected graph
| is connected