Safe Haskell | Safe |
---|---|

Language | Haskell2010 |

- isConnected :: Graph v e -> Bool
- isDisconnected :: Graph v e -> Bool
- areConnected :: Graph v e -> v -> v -> Bool
- areDisconnected :: Graph v e -> v -> v -> Bool
- unreachableVertices :: Graph v e -> [v]
- isWeaklyConnected :: DGraph v e -> Bool

# 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 `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`