projects
/
mtp.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
6647931
)
Comment update.
author
Francois Fleuret
<francois@fleuret.org>
Mon, 17 Sep 2012 13:24:25 +0000
(15:24 +0200)
committer
Francois Fleuret
<francois@fleuret.org>
Mon, 17 Sep 2012 13:24:25 +0000
(15:24 +0200)
mtp_graph.h
patch
|
blob
|
history
diff --git
a/mtp_graph.h
b/mtp_graph.h
index
9b34248
..
bdf8674
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-39,8
+39,8
@@
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
class MTPGraph {
// Uses the estimated vertex distances to the source to make all the
// edge lengths positive, resulting in an identical added value to
- //
the total length of any path from source to a certain node (in
- //
particular the
sink)
+ //
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
void update_positivized_lengths();
// It may happen that numerical errors in update_positivized_lengths
@@
-53,8
+53,9
@@
class MTPGraph {
// of shortest length. The current implementation is not Dijkstra's!
void find_shortest_path();
// 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.
+ // 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 retrieve_one_path(Edge *e, Path *path);
// Returns if the graph is a DAG
@@
-79,7
+80,12
@@
public:
~MTPGraph();
~MTPGraph();
+ // Compute the family of path with minimum total length, set the
+ // edge occupied fields accordingly.
void find_best_paths(scalar_t *lengths);
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);
void retrieve_disjoint_paths();
void print(ostream *os);