# HG changeset patch
# User athos
# Date 1083858462 0
# Node ID 2d27cbaa982dbd6618b3a4f76fa39e1aea30e281
# Parent  8e5102790d4db6ede737ee2b1ed2b587205af617
Method checkSolution() added.

diff -r 8e5102790d4d -r 2d27cbaa982d src/work/athos/mincostflows.h
--- a/src/work/athos/mincostflows.h	Thu May 06 15:39:31 2004 +0000
+++ b/src/work/athos/mincostflows.h	Thu May 06 15:47:42 2004 +0000
@@ -187,13 +187,15 @@
 
     //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(){
       Length mod_pot;
       Length fl_e;
       FOR_EACH_LOC(typename Graph::EdgeIt, e, G){
 	//C^{\Pi}_{i,j}
-	mod_pot = length[e]-potential[G.head(e)]+potential[G.head(e)];
+	mod_pot = length[e]-potential[G.head(e)]+potential[G.tail(e)];
 	fl_e = flow[e];
+	//	std::cout << fl_e << std::endl;
 	if (0<fl_e && fl_e<capacity[e]){
 	  if (mod_pot != 0)
 	    return false;
diff -r 8e5102790d4d -r 2d27cbaa982d src/work/athos/mincostflows_test.cc
--- a/src/work/athos/mincostflows_test.cc	Thu May 06 15:39:31 2004 +0000
+++ b/src/work/athos/mincostflows_test.cc	Thu May 06 15:47:42 2004 +0000
@@ -71,8 +71,12 @@
 
   check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
 
+  check(surb_test.checkSolution(), "Is the primal-dual solution pair really optimal?");
+
   k=1;
   check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
+
+  check(surb_test.checkSolution(), "Is the primal-dual solution pair really optimal?");
   
   //cout << surb_test.run(s,t,k) << surb_test.totalLength()<<endl;
   /*