ghcunstableAndy Gill <andygill@ku.edu>: is a basic graph structure over nodes of the higher kind e, with a single root. V There is an assumption that there is no Unique used in a node which does not have a . corresponding entry is the association list. G The idea with this structure is that it is trivial to convert into an Array,  IntMap, or into a Martin Erwig'$s Functional Graph, as required.  If e is s Functor, and e is  -able, then we can   a . ghcunstableAndy Gill <andygill@ku.edu>C is a class that provided a way to reference into a specific type, 1 and a way to map over the deferenced internals. $ takes a data structure that admits , and returns a  that contains 0 the dereferenced nodes, with their children as   rather than recursive values. C is a class that provided a way to reference into a specific type, 1 and a way to map over the deferenced internals.   $ takes a data structure that admits , and returns a  that contains 0 the dereferenced nodes, with their children as   rather than recursive values.         data-reify-0.4Data.Reify.GraphData.Dynamic.Reify Data.ReifyUniqueGraphMuRefDeRefmapDeRef reifyGraph $fShowGraphbaseGHC.ShowShowghc-prim GHC.TypesInt findNodesmylookup newUnique