2 ///////////////////////////////////////////////////////////////////////////
3 // This program is free software: you can redistribute it and/or modify //
4 // it under the terms of the version 3 of the GNU General Public License //
5 // as published by the Free Software Foundation. //
7 // This program is distributed in the hope that it will be useful, but //
8 // WITHOUT ANY WARRANTY; without even the implied warranty of //
9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
10 // General Public License for more details. //
12 // You should have received a copy of the GNU General Public License //
13 // along with this program. If not, see <http://www.gnu.org/licenses/>. //
15 // Written by and Copyright (C) Francois Fleuret //
16 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
17 ///////////////////////////////////////////////////////////////////////////
21 // Takes the graph description file as input and produces a dot file.
23 // EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
34 #include "mtp_graph.h"
37 //////////////////////////////////////////////////////////////////////
39 void find_best_paths(int nb_vertices,
40 int nb_edges, int *ea, int *eb, scalar_t *el,
42 int *result_edge_occupation) {
43 MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink);
44 graph.find_best_paths(el);
48 //////////////////////////////////////////////////////////////////////
50 int main(int argc, char **argv) {
52 int nb_time_steps = 10;
54 Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
56 for(int l = 0; l < nb_locations; l++) {
57 for(int k = 0; k < nb_locations; k++) {
58 tracker->set_allowed_motion(l, k, abs(l - k) <= 1);
62 for(int r = 0; r < 10; r++) {
63 cout << "* ROUND " << r << endl;
64 for(int t = 0; t < nb_time_steps; t++) {
65 for(int l = 0; l < nb_locations; l++) {
66 tracker->set_detection_score(t, l,
67 (drand48() < 0.9 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05);
69 tracker->set_detection_score(t, 0,
70 (drand48() < 0.9 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05);
73 tracker->build_graph();
76 for(int t = 0; t < tracker->nb_trajectories(); t++) {
77 cout << "TRAJECTORY " << t << " :";
78 for(int u = 0; u < tracker->trajectory_duration(t); u++) {
79 cout << " " << tracker->trajectory_location(t, u);