X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=README.txt;h=1bc9751768b8bfbb82e065f370349cf76922afca;hb=c9d00d422b892c609df86a847eee46b36722b8f6;hp=ba8e5935575b4fd121111fc8e86f01ceafcfa38b;hpb=9d07ad0ca713eaa08b2dd0f119fc4c8a078070ac;p=mtp.git

diff --git a/README.txt b/README.txt
index ba8e593..1bc9751 100644
--- a/README.txt
+++ b/README.txt
@@ -14,8 +14,9 @@ in
   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:
 
@@ -31,7 +32,7 @@ This software package includes three commands:
 
  - mtp_stress_test creates a larger problem with a lot of noise and
    multiple trajectories, to check the behavior of the code under
-   slightly more complex situation.
+   slightly more complex situations.
 
 * INSTALLATION
 
@@ -46,7 +47,7 @@ tracker.dat, and print the optimal detected trajectories.
 
 If you now execute
 
-  ./mtp --verbose --trajectory-file result.trj --graph-file graph.dot < tracker.dat
+  ./mtp --verbose --trajectory-file result.trj --graph-file graph.dot tracker.dat
 
 It will load the file tracker.dat saved by the previous command, run
 the detection, save the detected trajectories in result.trj, and the