Update with the Dijkstra using a Binary Heap for the min-priority queue.

[mtp.git] / README.txt

diff --git a/README.txt b/README.txt
index 026f508..a20e23d 100644 (file)
--- a/README.txt
+++ b/README.txt
@@ -14,7 +14,8 @@ in
   2011.
 
 This implementation is not the reference implementation used for the
-experiments presented in this article.
+experiments presented in this article. It uses a Dijkstra with a
+Binary Heap for the min-queue, and not the optimal Fibonacci heap.
 
 * INSTALLATION
 
@@ -131,4 +132,4 @@ structure
 
 --
 François Fleuret
-October 2012
+December 2012