projects
/
mtp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Cosmetics + added comments.
[mtp.git]
/
mtp_graph.h
diff --git
a/mtp_graph.h
b/mtp_graph.h
index
bd805c2
..
b07e461
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-1,7
+1,7
@@
/*
/*
- * mtp is the ``Multi Tracked Path'', an implementation of the
- * k-shortest path algorithm for multi-target tracking.
+ * mtp is the ``Multi Tracked Path
s
'', an implementation of the
+ * k-shortest path
s
algorithm for multi-target tracking.
*
* Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
* Written by Francois Fleuret <francois.fleuret@idiap.ch>
*
* Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
* Written by Francois Fleuret <francois.fleuret@idiap.ch>
@@
-38,13
+38,19
@@
class Edge;
class MTPGraph {
void update_positivized_lengths();
class MTPGraph {
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 force such length to zero, and print the
+ // correction when compiled in VERBOSE mode.
void force_positivized_lengths();
// Set the edge pred_edge_toward_source correspondingly to the path
void force_positivized_lengths();
// Set the edge pred_edge_toward_source correspondingly to the path
- // of shortest length.
+ // of shortest length.
The current implementation is not Dijkstra's!
void find_shortest_path();
// Follows the path starting on edge e and returns its length. If
// nodes is non-null, stores in it the nodes met along the path.
int retrieve_one_path(Edge *e, Path *path);
void find_shortest_path();
// Follows the path starting on edge e and returns its length. If
// nodes is non-null, stores in it the nodes met along the path.
int retrieve_one_path(Edge *e, Path *path);
+ // Returns if the graph is a DAG
+ int is_dag();
Vertex **_front, **_new_front;
Vertex **_front, **_new_front;
@@
-60,7
+66,7
@@
public:
int nb_paths;
Path **paths;
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();
int source, int sink);
~MTPGraph();