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, result_edge_occupation);
48 //////////////////////////////////////////////////////////////////////
50 int main(int argc, char **argv) {
52 int nb_time_steps = 5;
55 Tracker tracker(nb_time_steps, nb_locations);
57 for(int l = 0; l < nb_locations; l++) {
58 for(int k = 0; k < nb_locations; k++) {
59 tracker.set_allowed_motion(l, k, abs(l - k) <= 1);
63 for(int t = 0; t < nb_time_steps; t++) {
64 for(int l = 0; l < nb_locations; l++) {
65 tracker.set_detection_score(t, l,
66 (drand48() < 0.9 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05);
68 tracker.set_detection_score(t, 0,
69 (drand48() < 0.9 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05);
72 tracker.build_graph();
79 cerr << argv[0] << " <graph file>" << endl;
83 ifstream *file = new ifstream(argv[1]);
85 int nb_edges, nb_vertices;
90 (*file) >> nb_vertices >> nb_edges;
91 (*file) >> source >> sink;
93 scalar_t *edge_lengths = new scalar_t[nb_edges];
94 int *vertex_from = new int[nb_edges];
95 int *vertex_to = new int[nb_edges];
96 int *result_edge_occupation = new int[nb_edges];
98 for(int e = 0; e < nb_edges; e++) {
99 (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
102 find_best_paths(nb_vertices, nb_edges,
103 vertex_from, vertex_to, edge_lengths,
105 result_edge_occupation);
107 // dot_print(nb_vertices, nb_edges,
108 // vertex_from, vertex_to, edge_lengths,
110 // result_edge_occupation);
112 delete[] result_edge_occupation;
113 delete[] edge_lengths;
114 delete[] vertex_from;
119 cerr << "Can not open " << argv[1] << endl;