Changeset 607:327f7cf13843 in lemon-0.x for src/work/athos/mincostflows.h

Timestamp:

05/11/04 17:42:11 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

Finished MinLengthPaths?: a specialization of MinCostFlows?.

File:

• src/work/athos/mincostflows.h (modified) (6 diffs)

src/work/athos/mincostflows.h

@@ -9 +9 @@
 #include <iostream>
 #include <hugo/dijkstra.h>
-#include <graph_wrapper.h>
+#include <hugo/graph_wrapper.h>
 #include <hugo/maps.h>
 #include <vector>
@@ -78 +78 @@
 
 
+  protected:
     
     //Input
@@ -84 +85 @@
     const CapacityMap& capacity;
 
+
     //auxiliary variables
 
@@ -99 +101 @@
     Length total_length;
 
+
   public :
 
@@ -111 +114 @@
     ///Returns k if there are at least k edge-disjoint paths from s to t.
     ///Otherwise it returns the number of found edge-disjoint paths from s to t.
+    ///\todo May be it does make sense to be able to start with a nonzero 
+    /// feasible primal-dual solution pair as well.
     int run(Node s, Node t, int k) {
 
@@ -186 +191 @@
     }
 
-    //This function checks, whether the given solution is optimal
-    //Running after a \c run() should return with true
-    //In this "state of the art" this only check optimality, doesn't bother with feasibility
-    bool checkSolution(){
+    ///Returns a const reference to the EdgeMap \c flow. \pre \ref run() must
+    ///be called before using this function.
+    const EdgeIntMap &getFlow() const { return flow;}
+
+  ///Returns a const reference to the NodeMap \c potential (the dual solution).
+    /// \pre \ref run() must be called before using this function.
+    const EdgeIntMap &getPotential() const { return potential;}
+
+    ///This function checks, whether the given solution is optimal
+    ///Running after a \c run() should return with true
+    ///In this "state of the art" this only check optimality, doesn't bother with feasibility
+    ///
+    ///\todo Is this OK here?
+    bool checkComplementarySlackness(){
       Length mod_pot;
       Length fl_e;