persistent-vector based implementation

[matthewleon]

The original paper discusses an inductive Graph implementation based on "version tree" based arrays. I believe this was implemented in ML. Has there been any attempt to compare the performance of such an implementation in Haskell, perhaps using a library like this one? https://hackage.haskell.org/package/persistent-vector

[ivan-m]

There isn't really much of a comparison-oriented benchmark at this time.

Whilst something along the lines of a persistent-vector based implementation would be appreciated, it would probably be better to have it as a separate package (as FGL is part of the Haskell Platform we can't easily add new dependencies).