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

Language | Haskell2010 |

- areIsomorphic :: Graph g => g v e -> g v' e' -> Bool
- isomorphism :: Graph g => g v e -> g v' e' -> v -> v'
- isURegular :: UGraph v e -> Bool
- isDRegular :: DGraph v e -> Bool

# Documentation

areIsomorphic :: Graph g => g v e -> g v' e' -> Bool Source #

Tell if two graphs are isomorphic TODO: check first: same number of vertices, same number of edges

isomorphism :: Graph g => g v e -> g v' e' -> v -> v' Source #