Added PairingHeap test for Dijkstra's Algorithm
A test has been added to PairingHeapAnalysisTest that measures PairingHeap's performance in Dijkstra's Algorithm. A similar performance test measures PriorityQueue's performance in the same algorithm. The test for PriorityQueue has a bit of bad code style, so that might still need some improvement, but the efficiency is comparable. The test has been conducted on a small scale (size up to 10.000, increments of 1000 and 10 repeats), and it works.
More PairingHeap tests on Dijkstra's
Added additional tests of the PairingHeap on Dijkstra's Algorithm. These tests are the same as the original, but with denser graphs. Similar tests have been added for PriorityQueue for comparison. It seems that PairingHeap is faster in the long run from medium to dense graphs. The next step is to perform a big test, but that takes a few days of computations so I might also first try that multi-pass merging tactic.
Merge origin/master