The tracker seems to work.

[mtp.git] / mtp.cc

diff --git a/mtp.cc b/mtp.cc
index 118e521..bd6d296 100644 (file)
--- a/mtp.cc
+++ b/mtp.cc
@@ -34,6 +34,7 @@
 using namespace std;
 
 #include "mtp_graph.h"
+#include "tracker.h"
 
 //////////////////////////////////////////////////////////////////////
 
@@ -45,25 +46,30 @@ void find_best_paths(int nb_vertices,
   graph.find_best_paths(el, result_edge_occupation);
 }
 
-void dot_print(int nb_vertices,
-               int nb_edges, int *ea, int *eb, scalar_t *el,
-               int source, int sink,
-               int *edge_occupation) {
-  cout << "digraph {" << endl;
-  cout << "  node[shape=circle];" << endl;
-  for(int e = 0; e < nb_edges; e++) {
-    if(edge_occupation[e]) {
-      cout << "  " << ea[e] << " -> " << eb[e] << " [style=bold,color=black,label=\"" << el[e] << "\"];" << endl;
-    } else {
-      cout << "  " << ea[e] << " -> " << eb[e] << " [color=gray,label=\"" << el[e] << "\"];" << endl;
+//////////////////////////////////////////////////////////////////////
+
+int main(int argc, char **argv) {
+  int nb_locations = 3;
+  int nb_time_steps = 4;
+
+  Tracker tracker(nb_time_steps, nb_locations);
+
+  for(int l = 0; l < nb_locations; l++) {
+    for(int k = 0; k < nb_locations; k++) {
+      if(abs(l - k) <= 1) tracker.set_allowed_motion(l, k);
     }
   }
-  cout << "}" << endl;
-}
 
-//////////////////////////////////////////////////////////////////////
+  for(int t = 0; t < nb_time_steps; t++) {
+    for(int l = 0; l < nb_locations; l++) {
+      tracker.set_detection_score(t, l, -1.0);
+    }
+    tracker.set_detection_score(t, 0, 1.0);
+  }
 
-int main(int argc, char **argv) {
+  tracker.track();
+
+  exit(0);
 
   if(argc < 2) {
     cerr << argv[0] << " <graph file>" << endl;