1.1 --- a/src/work/athos/minlength_demo.cc Sun Apr 17 18:57:22 2005 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,52 +0,0 @@
1.4 -#include <iostream>
1.5 -#include <fstream>
1.6 -
1.7 -#include <list_graph.h>
1.8 -#include <lemon/dimacs.h>
1.9 -#include <lemon/time_measure.h>
1.10 -#include "minlengthpaths.h"
1.11 -//#include <time_measure.h>
1.12 -
1.13 -using namespace lemon;
1.14 -
1.15 -// Use a DIMACS max flow file as stdin.
1.16 -// read_dimacs_demo < dimacs_max_flow_file
1.17 -int main(int argc, char ** argv) {
1.18 - typedef ListGraph Graph;
1.19 -
1.20 - typedef Graph::Node Node;
1.21 - //typedef Graph::EachEdgeIt EachEdgeIt;
1.22 -
1.23 - Graph G;
1.24 - Node s, t;
1.25 - Graph::EdgeMap<int> cap(G);
1.26 - readDimacs(std::cin, G, cap, s, t);
1.27 -
1.28 - std::cout << "Minlengthpaths demo (ATHOS)..." << std::endl;
1.29 - //Graph::EdgeMap<int> flow(G); //0 flow
1.30 -
1.31 - // double pre_time=currTime();
1.32 -
1.33 - int k=1;
1.34 - if (argc>1)
1.35 - k = atoi(argv[1]);
1.36 - MinLengthPaths<Graph, Graph::EdgeMap<int> >
1.37 - surb_test(G,cap);
1.38 - Timer ts;
1.39 - ts.reset();
1.40 - std::cout << "Number of found paths: " << surb_test.run(s,t,k) << std::endl;
1.41 - std::cout << "elapsed time: " << ts << std::endl;
1.42 -
1.43 - std::cout << "Total length of found paths: " << surb_test.totalLength() << std::endl;
1.44 - //std::cout << (surb_test.checkComplementarySlackness() ? "OK (compl. slackn.)." : "Problem (compl. slackn.)!!!") << std::endl;
1.45 -
1.46 - //preflow_push<Graph, int> max_flow_test(G, s, t, cap);
1.47 - //int flow_value=max_flow_test.run();
1.48 -
1.49 - //double post_time=currTime();
1.50 -
1.51 - //std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl;
1.52 - //std::cout << "flow value: "<< flow_value << std::endl;
1.53 -
1.54 - return 0;
1.55 -}