-The edges from the source or to the sink, or between these pairs of
-nodes, are of length zero, and the edges between the two nodes of such
-a pair have negative lengths, equal to the opposite of the
-corresponding detection scores.
+From this setting, MTPTracker has methods to compute the best set of
+disjoint trajectories consistent with the defined topology, which
+maximizes the overall detection score (i.e. the sum of the detection
+scores of the nodes visited by the trajectories). If no trajectory of
+total positive detection score exists, this optimal set of
+trajectories will be empty.
+
+The MTPTracker is a wrapper around the MTPGraph class. From the
+defined spatial topology and number of time steps, it builds a graph
+with one source, one sink, and two nodes per location and time. The
+edges from the source or to the sink, or between these pairs of nodes,
+are of length zero, and the edges between the two nodes of such a pair
+have negative lengths, equal to the opposite of the corresponding
+detection scores. This structure also ensures that the trajectories
+computed by the MTPTracker will be node-disjoint, since the
+trajectories computed by the MTPGraph are edge-disjoint.