projects
/
mtp.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
f1ca803
)
Cosmetics.
author
Francois Fleuret
<francois@fleuret.org>
Wed, 19 Dec 2012 16:24:10 +0000
(17:24 +0100)
committer
Francois Fleuret
<francois@fleuret.org>
Wed, 19 Dec 2012 16:24:10 +0000
(17:24 +0100)
mtp_graph.h
patch
|
blob
|
history
diff --git
a/mtp_graph.h
b/mtp_graph.h
index
2bc5933
..
bad0df5
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-77,11
+77,12
@@
class MTPGraph {
Edge *_edges;
Vertex *_vertices;
Edge *_edges;
Vertex *_vertices;
- // For the shortest path search
-
+ // For Dijkstra
Vertex **_heap;
int _heap_size;
Vertex **_heap;
int _heap_size;
+ // Updating the distances from the source in that order will work in
+ // the original graph (which has to be a DAG)
Vertex **_dp_order;
public:
Vertex **_dp_order;
public:
@@
-95,11
+96,11
@@
public:
~MTPGraph();
~MTPGraph();
- // Compute the family of path with minimum total length, set the
+ // Compute the family of path
s
with minimum total length, set the
// edge occupied fields accordingly.
void find_best_paths(scalar_t *lengths);
// edge occupied fields accordingly.
void find_best_paths(scalar_t *lengths);
- // Retrieve the path corresponding to the occupied edges, and save
+ // Retrieve the path
s
corresponding to the occupied edges, and save
// the result in the nb_paths and paths fields.
void retrieve_disjoint_paths();
// the result in the nb_paths and paths fields.
void retrieve_disjoint_paths();