How to load a huge graph into memory to repeatedly find shortest path between two given nodes?
<p>I am writing an application in which I need to load a huge graph into memory and answer "shortest path between x and y" for different pairs of x and y. The graph is static and can be loaded once for all into main memory. </p>

<p>The query for shortest path between x and y is made by a UI written in PHP. How can I keep the graph loaded in memory and find the shortest path repeatedly in an efficient way ? Is writing a JAVA daemon going to help ?</p>
