MATSim Code

Brought to you by: jwjoubert, laemmel, michaz, mrieser, and 3 others

Commit [r26060] Maximize Restore History

Replaced the PriorityQueue used by the Dijkstra. The (Wrapped)BinaryMinHeap should have a smaller memory footprint and a higher performance than the PseudoRemovePriorityQueue that was used so far.

Authored by: skull5 2013-10-08

Browse code at this revision

Parent: [r26059]

Child: [r26061]

changed	/matsim/trunk/src/main/java/org/matsim/core/router/Dijkstra.java
changed	/matsim/trunk/src/main/java/org/matsim/core/router/FastAStarEuclidean.java
changed	/matsim/trunk/src/main/java/org/matsim/core/router/FastAStarLandmarks.java
changed	/matsim/trunk/src/main/java/org/matsim/core/router/FastDijkstra.java

MATSim Code

Commit [r26060] Maximize Restore History

/matsim/trunk/src/main/java/org/matsim/core/router/Dijkstra.java Diff Switch to side-by-side view

/matsim/trunk/src/main/java/org/matsim/core/router/FastAStarEuclidean.java Diff Switch to side-by-side view

/matsim/trunk/src/main/java/org/matsim/core/router/FastAStarLandmarks.java Diff Switch to side-by-side view

/matsim/trunk/src/main/java/org/matsim/core/router/FastDijkstra.java Diff Switch to side-by-side view