+ - the allowed motions between them (a Boolean flag for each pair
+ of locations from/to)
+
+ - the entrances (a Boolean flag for each location and time step)
+
+ - the exits (a Boolean flag for each location and time step)
+
+ (2) a number of time steps
+
+ (3) a detection score for every location and time, which stands for
+ log(P(Y = 1 | X)/P(Y = 0 | X)) where Y is the said location
+ occupancy and X the available observations.
+
+From this setting, MTPTracker has methods to compute the best set of
+disjoint trajectories 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). 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.