You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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
The text was updated successfully, but these errors were encountered:
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).
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-vectorThe text was updated successfully, but these errors were encountered: