From 90a6bc97162d199e3b840bf178f49854e5df91fa Mon Sep 17 00:00:00 2001 From: Francois Fleuret Date: Fri, 14 Sep 2012 16:32:50 +0200 Subject: [PATCH] Cosmetics + added comments. --- mtp_graph.cc | 4 ---- mtp_graph.h | 4 ++++ 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/mtp_graph.cc b/mtp_graph.cc index c456601..6ce84c4 100644 --- a/mtp_graph.cc +++ b/mtp_graph.cc @@ -24,7 +24,6 @@ #include "mtp_graph.h" -// #include #include using namespace std; @@ -161,9 +160,6 @@ void MTPGraph::print_dot(ostream *os) { (*os) << " " << _sink->id << " [peripheries=2];" << endl; for(int k = 0; k < _nb_edges; k++) { Edge *e = _edges + k; - // (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id - // << ";" - // << endl; (*os) << " " << e->origin_vertex->id << " -> " << e->terminal_vertex->id << " ["; if(e->occupied) { diff --git a/mtp_graph.h b/mtp_graph.h index 9093a8b..b07e461 100644 --- a/mtp_graph.h +++ b/mtp_graph.h @@ -38,6 +38,10 @@ class Edge; 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 // of shortest length. The current implementation is not Dijkstra's! -- 2.20.1