[Lemon-user] Custom graph data and lemon

[Costa Basil]

1. I took a closer look and basically reserveEdge allocates 2 * m where m 
is the number of edges and it's an int. So the maximum number of edges 
that I can allocate is 1,073,741,823.
2. It doesn't seem possible.
3. I haven't looked at it yet.




________________________________
 From: Costa Basil <costa_basil at yahoo.ca>
To: lemon-user at lemon.cs.elte.hu 
Sent: Friday, March 1, 2013 11:28:54 PM
Subject: Custom graph data and lemon
 

I am new to lemon... I have a unidirectional graph with about 80 million nodes and approx 2 billion edges. I need to find the shortest paths between some nodes ( for two given nodes there could be multiple shortest paths ). The graph once created it is immutable. My computer has 16gb of memory . My questions are these:

1. Is it feasible to create so many nodes & edges using lemon with 16 gb of ram?
2. Can I use my own data structures with lemon, perhaps via some kind of interface? And would it be possible to have control over the node ids (they are of type unsigned long) instead of adding these numbers as additional data? 
3. Can the lemon dijkstra algorithm return multiple shortest paths between two nodes?

I used in the past neo4j, however it takes too long to creates so many edges and nodes.

Thank
 you 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20130305/edcc1d70/attachment.html>