Math.Grads.Graph

Module that provides Graph type class and several useful functions for interaction with Graphs.

Documentation

type EdgeList e = [GraphEdge e]

Type alias for list of GraphEdges.

class Graph g where

Type class that gives data structure properties of graph.

Minimal complete definition

fromList, toList, vCount, (!>), (!.), (?>), (?.)

Methods

fromList :: (Ord v, Eq v) => ([v], [GraphEdge e]) -> g v e

Construct a graph from list of vertices and edges.

toList :: (Ord v, Eq v) => g v e -> ([v], [GraphEdge e])

Get a list of all vertices and edges from the graph.

vCount :: g v e -> Int

Get the number of vertices.

(!>) :: (Ord v, Eq v) => g v e -> v -> [(v, e)] infixl 9

Unsafe get adjacent vertices.

(!.) :: g v e -> Int -> [(Int, e)] infixl 9

Unsafe get adjacent indices.

(?>) :: (Ord v, Eq v) => g v e -> v -> Maybe [(v, e)] infixl 9

Safe get adjacent vertices.

(?.) :: g v e -> Int -> Maybe [(Int, e)] infixl 9

Safe get adjacent indices.

incident :: (Ord v, Eq v) => g v e -> v -> [(v, v, e)]

Get a list of edges starting at given vertex.

safeIncident :: (Ord v, Eq v) => g v e -> v -> Maybe [(v, v, e)]

Safe get a list of edges starting at given vertex.

incidentIdx :: Eq e => g v e -> Int -> [GraphEdge e]

Get a list of index edges starting at given vertex.

safeIncidentIdx :: Eq e => g v e -> Int -> Maybe [GraphEdge e]

Safe get a list of index edges starting at given vertex.

Instances

Graph GenericGraph

Defined in Math.Grads.GenericGraph

Methods

fromList :: (Ord v, Eq v) => ([v], [GraphEdge e]) -> GenericGraph v e

toList :: (Ord v, Eq v) => GenericGraph v e -> ([v], [GraphEdge e])

vCount :: GenericGraph v e -> Int

(!>) :: (Ord v, Eq v) => GenericGraph v e -> v -> [(v, e)]

(!.) :: GenericGraph v e -> Int -> [(Int, e)]

(?>) :: (Ord v, Eq v) => GenericGraph v e -> v -> Maybe [(v, e)]

(?.) :: GenericGraph v e -> Int -> Maybe [(Int, e)]

incident :: (Ord v, Eq v) => GenericGraph v e -> v -> [(v, v, e)]

safeIncident :: (Ord v, Eq v) => GenericGraph v e -> v -> Maybe [(v, v, e)]

incidentIdx :: Eq e => GenericGraph v e -> Int -> [GraphEdge e]

safeIncidentIdx :: Eq e => GenericGraph v e -> Int -> Maybe [GraphEdge e]

type GraphEdge e = (Int, Int, e)

GraphEdge is just triple, containing index of starting vertex of edge, index of ending vertex of edge and edge's type.

changeIndsEdge :: (Int -> Int) -> GraphEdge e -> GraphEdge e

Given transformation of edge's indices transforms GraphEdge.

changeTypeEdge :: (e1 -> e2) -> GraphEdge e1 -> GraphEdge e2

Given transformation of edge types transforms GraphEdge.

edgeType :: GraphEdge e -> e

Get edge's type from GraphEdge.