# HG changeset patch
# User athos
# Date 1083663201 0
# Node ID e4a6300616f9d6cd63a8fc64fae41b9afab5e981
# Parent  474f5508e9a2b8efbf910c6b0734e22ba686f393
Created minlengthpaths_test.cc. Compiles with: g++-3.0 -Wall -I. -I../{klao,jacint,marci} -I.. -I../../include minlengthpaths_test.cc -o min | & less

diff -r 474f5508e9a2 -r e4a6300616f9 src/work/athos/minlengthpaths.h
--- a/src/work/athos/minlengthpaths.h	Tue May 04 09:03:00 2004 +0000
+++ b/src/work/athos/minlengthpaths.h	Tue May 04 09:33:21 2004 +0000
@@ -187,7 +187,7 @@
       typename DirPath::Builder B(p);
       for(typename std::vector<Edge>::iterator i=paths[j].begin(); 
 	  i!=paths[j].end(); ++i ){
-	B.pushBack(*j);
+	B.pushBack(*i);
       }
 
       B.commit();
diff -r 474f5508e9a2 -r e4a6300616f9 src/work/athos/minlengthpaths_test.cc
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/work/athos/minlengthpaths_test.cc	Tue May 04 09:33:21 2004 +0000
@@ -0,0 +1,92 @@
+#include <iostream>
+#include <list_graph.h>
+#include <minlengthpaths.h>
+#include <path.h>
+
+using namespace std;
+using namespace hugo;
+
+
+
+bool passed = true;
+
+void check(bool rc, char *msg="") {
+  passed = passed && rc;
+  if(!rc) {
+    std::cerr << "Test failed! ("<< msg << ")" << std::endl; \
+ 
+
+  }
+}
+
+
+
+int main()
+{
+
+  typedef ListGraph::Node Node;
+  typedef ListGraph::Edge Edge;
+
+  ListGraph graph;
+
+  //Ahuja könyv példája
+
+  Node s=graph.addNode();
+  Node v1=graph.addNode();  
+  Node v2=graph.addNode();
+  Node v3=graph.addNode();
+  Node v4=graph.addNode();
+  Node v5=graph.addNode();
+  Node t=graph.addNode();
+
+  Edge s_v1=graph.addEdge(s, v1);
+  Edge v1_v2=graph.addEdge(v1, v2);
+  Edge s_v3=graph.addEdge(s, v3);
+  Edge v2_v4=graph.addEdge(v2, v4);
+  Edge v2_v5=graph.addEdge(v2, v5);
+  Edge v3_v5=graph.addEdge(v3, v5);
+  Edge v4_t=graph.addEdge(v4, t);
+  Edge v5_t=graph.addEdge(v5, t);
+  
+
+  ListGraph::EdgeMap<int> length(graph);
+
+  length.set(s_v1, 6);
+  length.set(v1_v2, 4);
+  length.set(s_v3, 10);
+  length.set(v2_v4, 5);
+  length.set(v2_v5, 1);
+  length.set(v3_v5, 5);
+  length.set(v4_t, 8);
+  length.set(v5_t, 8);
+
+  std::cout << "Minlengthpaths algorithm test..." << std::endl;
+
+  
+  int k=3;
+  MinLengthPaths< ListGraph, ListGraph::EdgeMap<int> >
+    surb_test(graph, length);
+
+  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
+
+  typedef DirPath<ListGraph> DPath;
+  DPath P(graph);
+
+  surb_test.getPath(P,0);
+  check(P.length() == 4, "First path should contain 4 edges.");  
+
+  surb_test.getPath(P,1);
+  check(P.length() == 3, "Second path: 3 edges.");
+  
+  k=1;
+  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
+ 
+  surb_test.getPath(P,0);
+  check(P.length() == 4, "First path should contain 4 edges.");  
+
+  cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
+       << endl;
+
+  return passed ? 0 : 1;
+
+}