X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=mtp.git;a=blobdiff_plain;f=README.txt;h=708fea63fa8f92a5b9a3a0ad266739070d87fe06;hp=eb8a26f5ab481d90a49fd618849cfce4a02479ef;hb=f248d9481cd0338053cb38a18eb3898042c126d3;hpb=53da5d9421597dfc056b5727dbe7898afd30bdc9

diff --git a/README.txt b/README.txt
index eb8a26f..708fea6 100644
--- a/README.txt
+++ b/README.txt
@@ -31,7 +31,7 @@ with the dot command from graphviz:
 
 * IMPLEMENTATION
 
-The two main classes are MTPGraph and Tracker.
+The two main classes are MTPGraph and MTPTracker.
 
 The MTPGraph class stores a directed acyclic graph (DAG), with a
 length for each edge -- which can be negative -- and can compute the
@@ -43,7 +43,7 @@ no path at all. Note that the procedure is similar to that of KSP, in
 the sense that the family it computes eventually is globally optimal,
 even if the computation is iterative.
 
-The Tracker class allows
+The MTPTracker class allows
 
  (1) to define a spatial topology composed of
 
@@ -64,7 +64,7 @@ consistent with the topology, which maximizes the overall detection
 score (i.e. the sum of the detection scores of the nodes visited by
 the trajectories)
 
-The Tracker class uses the MTPGraph. From the definition of the
+The MTPTracker class uses the MTPGraph. From the definition of the
 spatial topology, it builds a graph with one source, one sink, and two
 nodes per location and time. This structure ensures the trajectories
 computed by the tracker to be node-disjoint by forcing the paths
@@ -74,10 +74,10 @@ The edges from the source or to the sink, or between these pairs, are
 of length zero, and the edge between the two nodes of such a pair has
 a length equal to the opposite of the detection score.
 
-The file mtp.cc gives a very simple usage example of the Tracker
+The file mtp.cc gives a very simple usage example of the MTPTracker
 class.
 
-The tracker data file one can read with Tracker::read has the
+The tracker data file one can read with MTPTracker::read has the
 following format (with L the number of locations and T the number of
 time steps):