2011.
This implementation is not the reference implementation used for the
-experiments presented in this article. It uses a Dijkstra with a
-Binary Heap for the min-queue, and not the optimal Fibonacci heap.
+experiments presented in this article. It does not require any
+library, and uses a Dijkstra with a Binary Heap for the min-queue,
+instead of a Fibonacci heap.
This software package includes three commands: