* 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
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
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
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):