projects
/
mtp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Comment update.
[mtp.git]
/
mtp_graph.h
diff --git
a/mtp_graph.h
b/mtp_graph.h
index
b07e461
..
bdf8674
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-37,18
+37,27
@@
class Vertex;
class Edge;
class MTPGraph {
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();
void update_positivized_lengths();
+
// It may happen that numerical errors in update_positivized_lengths
// make the resulting lengths negative, albeit very small. The
// 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.
+ // following method force
s all negative lengths to zero, and prints
+ //
the total
correction when compiled in VERBOSE mode.
void force_positivized_lengths();
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();
// 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();
- // 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);
int retrieve_one_path(Edge *e, Path *path);
+
// Returns if the graph is a DAG
int is_dag();
// Returns if the graph is a DAG
int is_dag();
@@
-71,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);