Safe Haskell  None 

Language  Haskell2010 
Documentation
A graphbased representation of a Graph
: a bunch of vertices
(each with a unique i
), each holding a value of type v
and pointers to
the neighbours of the vertex.
Graphs are not typically represented this way because if the graph has a cycle in it, we will not be able to make any changes to the graph without reallocating all the nodes which are part of that cycle and all the nodes which point to it. For this reason, we do not offer any update operations.
Graph  

Vertex  
