[<<][compsci][>>][..]
Thu Aug 26 11:24:28 CEST 2010

Graphs without mutation

I'm facing with the following problem:

    * Construct a graph data structure (pointers in C structs) without
      using mutation in the sub-structures.  This would need some kind
      of "magic" Y combinator-like operation.

    * Represent a graph in using a non-cyclic _constant_ data
      structure, so no zipper-like tree rewriting that requires new
      constructors to be called.



[Reply][About]
[<<][compsci][>>][..]