From 656afdeaf084a2b7d173f3710678d0c9bb0cc90a Mon Sep 17 00:00:00 2001
From: Francois Fleuret <francois@fleuret.org>
Date: Mon, 7 Jan 2013 10:42:22 +0100
Subject: [PATCH] Updated a comment.

---
 mtp_graph.cc | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/mtp_graph.cc b/mtp_graph.cc
index a7b942d..2abe52b 100644
--- a/mtp_graph.cc
+++ b/mtp_graph.cc
@@ -459,7 +459,9 @@ void MTPGraph::compute_dp_ordering() {
   while(already_processed < front) {
     // Here, nodes before already_processed can be ignored, nodes
     // before front were set to 0 predecessors during the previous
-    // iteration. We will add the 
+    // iteration. During this new iteration, we have to visit the
+    // successors of these ones only, since they are the only ones
+    // potentially having now predecessors anymore.
     new_front = front;
     while(already_processed < front) {
       v = *(already_processed++);
-- 
2.20.1