X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_graph.h;h=bdf8674b9033f575e9687ec3be1000dcb41fb693;hb=20f94c6bff1541da8d0639966787dc8aaafea025;hp=6b8c181afe7c734f2da324e4a37de6b71b310546;hpb=7704ecb19140055b21e1012cd0d394f2a6db98eb;p=mtp.git
diff --git a/mtp_graph.h b/mtp_graph.h
index 6b8c181..bdf8674 100644
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -1,20 +1,26 @@
-///////////////////////////////////////////////////////////////////////////
-// This program is free software: you can redistribute it and/or modify //
-// it under the terms of the version 3 of the GNU General Public License //
-// as published by the Free Software Foundation. //
-// //
-// This program is distributed in the hope that it will be useful, but //
-// WITHOUT ANY WARRANTY; without even the implied warranty of //
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
-// General Public License for more details. //
-// //
-// You should have received a copy of the GNU General Public License //
-// along with this program. If not, see . //
-// //
-// Written by and Copyright (C) Francois Fleuret //
-// Contact for comments & bug reports //
-///////////////////////////////////////////////////////////////////////////
+/*
+ * mtp is the ``Multi Tracked Paths'', an implementation of the
+ * k-shortest paths algorithm for multi-target tracking.
+ *
+ * Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
+ * Written by Francois Fleuret
+ *
+ * This file is part of mtp.
+ *
+ * mtp is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 3 as
+ * published by the Free Software Foundation.
+ *
+ * mtp is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with selector. If not, see .
+ *
+ */
#ifndef MTP_GRAPH_H
#define MTP_GRAPH_H
@@ -31,12 +37,29 @@ class Vertex;
class Edge;
class MTPGraph {
+ // Uses the estimated vertex distances to the source to make all the
+ // edge lengths positive, resulting in an identical added value to
+ // all the paths from the same initial node to the same final node
+ // (in particular from source to sink)
void update_positivized_lengths();
+
+ // It may happen that numerical errors in update_positivized_lengths
+ // make the resulting lengths negative, albeit very small. The
+ // following method forces all negative lengths to zero, and prints
+ // the total correction when compiled in VERBOSE mode.
void force_positivized_lengths();
+
+ // Set the edge pred_edge_toward_source correspondingly to the path
+ // of shortest length. The current implementation is not Dijkstra's!
void find_shortest_path();
- // Retrieve the path starting on edge e and return its length. If
- // nodes is non-null, stores the node met along the path in it.
- int retrieve_one_path(Edge *e, int *nodes);
+
+ // Follows the path starting on edge e and returns the number of
+ // nodes to reach the sink. If path is non-null, stores in it the
+ // nodes met along the path, and computes path->length properly.
+ int retrieve_one_path(Edge *e, Path *path);
+
+ // Returns if the graph is a DAG
+ int is_dag();
Vertex **_front, **_new_front;
@@ -52,12 +75,17 @@ public:
int nb_paths;
Path **paths;
- MTPGraph(int nb_vertices, int nb_edges, int *from, int *to,
+ MTPGraph(int nb_vertices, int nb_edges, int *vertex_from, int *vertex_to,
int source, int sink);
~MTPGraph();
+ // Compute the family of path with minimum total length, set the
+ // edge occupied fields accordingly.
void find_best_paths(scalar_t *lengths);
+
+ // Retrieve the path corresponding to the occupied edges, and save
+ // the result in the nb_paths and paths fields.
void retrieve_disjoint_paths();
void print(ostream *os);