> I can try to use the nodes/specs you provide to give you an estimate
> of what my framework can handle. If that works for you, I'll clean up
> my code and you can give it a shot. Send me whatever other details you
> think are relevant.
Benjamin,
I had a few moments, so I made a sparse graph of
Benjamin,
> - Immutable structure, mutable labels. After initially reading in the
> graphs, their shape doesn't change, but information "flows" around the graph,
> changing the labels on nodes and edges.
I have been working on a similar problem for a while now, hence my
interest and dissatisfa
I had issues with FGL in the past, too. Although FGL is really nice to
work with, it just uses a ridiculous amount of memory for large
graphs.
In the end, I used Data.Graph from containers [1]. This was a lot more
reasonable, and let me finish my project relatively easily.
Regards,
- Clark
[1]
2012/5/20 Benjamin Ylvisaker :
> I have a problem that I'm trying to use Haskell for, and I think I'm running
> into scalability issues in FGL. However, I am quite new to practical
> programming in Haskell, so it's possible that I have some other bone-headed
> performance bug in my code. I tri
I have a problem that I'm trying to use Haskell for, and I think I'm running
into scalability issues in FGL. However, I am quite new to practical
programming in Haskell, so it's possible that I have some other bone-headed
performance bug in my code. I tried looking around for concrete informat
