projects
/
mtp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Cosmetics.
[mtp.git]
/
mtp_graph.cc
diff --git
a/mtp_graph.cc
b/mtp_graph.cc
index
1f0f6d3
..
92e3875
100644
(file)
--- a/
mtp_graph.cc
+++ b/
mtp_graph.cc
@@
-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>
@@
-96,7
+96,7
@@
void Vertex::del_leaving_edge(Edge *e) {
//////////////////////////////////////////////////////////////////////
MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
//////////////////////////////////////////////////////////////////////
MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
- int *
from, int *
to,
+ int *
vertex_from, int *vertex_
to,
int source, int sink) {
_nb_vertices = nb_vertices;
_nb_edges = nb_edges;
int source, int sink) {
_nb_vertices = nb_vertices;
_nb_edges = nb_edges;
@@
-114,11
+114,11
@@
MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
}
for(int e = 0; e < nb_edges; e++) {
}
for(int e = 0; e < nb_edges; e++) {
- _vertices[from[e]].add_leaving_edge(_edges + e);
+ _vertices[
vertex_
from[e]].add_leaving_edge(_edges + e);
_edges[e].occupied = 0;
_edges[e].id = e;
_edges[e].occupied = 0;
_edges[e].id = e;
- _edges[e].origin_vertex = _vertices + from[e];
- _edges[e].terminal_vertex = _vertices + to[e];
+ _edges[e].origin_vertex = _vertices +
vertex_
from[e];
+ _edges[e].terminal_vertex = _vertices +
vertex_
to[e];
}
paths = 0;
}
paths = 0;