| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Math.Grads.Algo.Isomorphism.Types
Synopsis
- type VertexIndex = Int
- type VComparator v1 v2 = VertexIndex -> VertexIndex -> Bool
- type EComparator e1 e2 = GraphEdge e1 -> GraphEdge e2 -> Bool
- class (Graph g1, Graph g2) => GComparable g1 v1 e1 g2 v2 e2 where
- vComparator :: g1 v1 e1 -> g2 v2 e2 -> VComparator v1 v2
- eComparator :: g1 v1 e1 -> g2 v2 e2 -> EComparator e1 e2
Documentation
type VertexIndex = Int Source #
Type alias for Int.
type VComparator v1 v2 = VertexIndex -> VertexIndex -> Bool Source #
Function that checks whether two vertices are identical. Due to properties related to index of vertex, like number of neighbors, we consider vertex indices instead of vertices.
type EComparator e1 e2 = GraphEdge e1 -> GraphEdge e2 -> Bool Source #
Function that checks whether two edges are identical. Due to properties related to index of vertex, like belonging to a cycle, we consider GraphEdge (Int, Int, e) instead of e.
class (Graph g1, Graph g2) => GComparable g1 v1 e1 g2 v2 e2 where Source #
Type class for graphs that could be checked for isomorphism.
Methods
vComparator :: g1 v1 e1 -> g2 v2 e2 -> VComparator v1 v2 Source #
eComparator :: g1 v1 e1 -> g2 v2 e2 -> EComparator e1 e2 Source #