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
945f387
..
b07e461
100644
(file)
--- a/
mtp_graph.h
+++ b/
mtp_graph.h
@@
-38,9
+38,13
@@
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.
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.