From fc369d56ff5774f00daecb744827f822472cf2ab Mon Sep 17 00:00:00 2001 From: Francois Fleuret Date: Wed, 19 Dec 2012 17:24:10 +0100 Subject: [PATCH] Cosmetics. --- mtp_graph.h | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/mtp_graph.h b/mtp_graph.h index 2bc5933..bad0df5 100644 --- a/mtp_graph.h +++ b/mtp_graph.h @@ -77,11 +77,12 @@ class MTPGraph { Edge *_edges; Vertex *_vertices; - // For the shortest path search - + // For Dijkstra 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: @@ -95,11 +96,11 @@ public: ~MTPGraph(); - // Compute the family of path with minimum total length, set the + // Compute the family of paths with minimum total length, set the // edge occupied fields accordingly. void find_best_paths(scalar_t *lengths); - // Retrieve the path corresponding to the occupied edges, and save + // Retrieve the paths corresponding to the occupied edges, and save // the result in the nb_paths and paths fields. void retrieve_disjoint_paths(); -- 2.20.1