1

I'd like to give Martin Erwing's inductive graph implementation a shot. However, I am still new to Haskell's type system, specifically when it comes to defining abstract data types. I was hoping someone could supply a clear, near-trivial example of an this approach to implementing a graph in Haskell.

Here's the documentation behind it, and his paper

Thanks

4

1 回答 1

0

您可以在这里查看一个简单的基于树的实现：http: //hackage.haskell.org/packages/archive/fgl/5.4.2.4/doc/html/src/Data-Graph-Inductive-Tree.html#Gr

于 2013-05-28T04:46:23.603 回答