Changeset 633:305bd9c56f10 in lemon-0.x for src/hugo/mincostflows.h

Timestamp:

05/13/04 18:00:18 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@824

Message:

Slight modifications.

File:

• src/hugo/mincostflows.h (modified) (5 diffs)

src/hugo/mincostflows.h

@@ -93 +93 @@
     typename Graph::template NodeMap<Length> potential;
     
-    //Container to store found paths
-    //std::vector< std::vector<Edge> > paths;
-    //typedef DirPath<Graph> DPath;
-    //DPath paths;
-
 
     Length total_length;
@@ -152 +147 @@
         };
         
+        //We have to copy the potential
+        FOR_EACH_LOC(typename ResGraphType::NodeIt, n, res_graph){
+          potential[n] += dijkstra.distMap()[n];
+        }
+        /*
         {
           //We have to copy the potential
@@ -159 +159 @@
           }
         }
-
+        */
 
         //Augmenting on the sortest path
@@ -226 +226 @@
     }
     
-    /*
-      ///\todo To be implemented later
-
-    ///This function gives back the \c j-th path in argument p.
-    ///Assumes that \c run() has been run and nothing changed since then.
-    /// \warning It is assumed that \c p is constructed to be a path of graph \c G. If \c j is greater than the result of previous \c run, then the result here will be an empty path.
-    template<typename DirPath>
-    void getPath(DirPath& p, int j){
-      p.clear();
-      typename DirPath::Builder B(p);
-      for(typename std::vector<Edge>::iterator i=paths[j].begin(); 
-          i!=paths[j].end(); ++i ){
-        B.pushBack(*i);
-      }
-
-      B.commit();
-    }
-
-    */
 
   }; //class MinCostFlows
@@ -252 +233 @@
 } //namespace hugo
 
-#endif //HUGO_MINCOSTFLOW_H
+#endif //HUGO_MINCOSTFLOWS_H