[jgrapht-users] jgrpht-Floyd Warshall's Algorithm

[Sandeep S. <san...@gm...>]

Hi,

I am pretty new to jgrapht.

I am trying to run all-pairs shortest path Algorithm for the city of
Chicago. The data source is OpenStreetMaps and has 100k nodes. I used
jgrapht library for creating the graph.  But when I tried to run the Floyd
Warshall's Algorithm on the graph, the program existed with error:
Insufficient Java heap memory. I ran Dijktra's shorted path on this graph
and was successful. I already tried increasing the heap size in the Eclipse
IDE.

How do I deal with this issue?

System Config: 64 bit, 16 GB RAM (Eclipse on Windows)

I really appreciate your reply

Thank you

Sandeep