alpar@906: /* -*- C++ -*-
alpar@921:  * src/test/dijkstra_heap_test.cc - Part of LEMON, a generic C++ optimization library
alpar@906:  *
alpar@1164:  * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@906:  * (Egervary Combinatorial Optimization Research Group, EGRES).
alpar@906:  *
alpar@906:  * Permission to use, modify and distribute this software is granted
alpar@906:  * provided that this copyright notice appears in all copies. For
alpar@906:  * precise terms see the accompanying LICENSE file.
alpar@906:  *
alpar@906:  * This software is provided "AS IS" with no warranty of any kind,
alpar@906:  * express or implied, and with no claim as to its suitability for any
alpar@906:  * purpose.
alpar@906:  *
alpar@906:  */
alpar@906: 
jacint@384: //Tests dijsktra.h with two heap implementations:
jacint@384: //the default binary heap of bin_heap.h, and the 
jacint@384: //Fibonacci heap of fib_heap.h.
jacint@384: 
jacint@384: //The input is a graph in standard dimacs format from the standard input (like
alpar@921: //in /lemon_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
jacint@422: //heaps, checking two postconditions:
jacint@384: 
jacint@384: //- if the edges e=uv of the shortest path tree reported by dijkstra.h have
jacint@384: //dist(v)-dist(u)=length(e)
jacint@384: 
jacint@384: // - if all edges e=uv with u reachable from the root have
jacint@384: //dist(v)-dist(u)>=length(e)
jacint@384: #include <iostream>
jacint@384: #include <math.h>
jacint@384: 
alpar@921: #include <lemon/smart_graph.h>
deba@1194: 
deba@1194: #include <lemon/graph_writer.h>
deba@1194: #include <lemon/map_utils.h>
deba@1194: 
deba@1194: 
alpar@921: #include <lemon/dimacs.h>
alpar@921: #include <lemon/dijkstra.h>
alpar@921: #include <lemon/time_measure.h>
deba@1194: #include <lemon/graph_utils.h>
deba@1194: 
alpar@921: #include <lemon/bin_heap.h>
alpar@921: #include <lemon/fib_heap.h>
deba@1194: #include <lemon/radix_heap.h>
jacint@384: 
alpar@921: using namespace lemon;
jacint@384: 
deba@1194: typedef ListGraph Graph;
deba@1194: 
deba@1194: typedef Graph::Edge Edge;
deba@1194: typedef Graph::Node Node;
deba@1194: typedef Graph::EdgeIt EdgeIt;
deba@1194: typedef Graph::NodeIt NodeIt;
deba@1194: typedef Graph::EdgeMap<int> LengthMap;
deba@1194: 
deba@1194: 
deba@1194: struct FibTraits : public DijkstraDefaultTraits<Graph, LengthMap> {
deba@1194:   typedef FibHeap<Graph::Node, LengthMap::Value, Graph::NodeMap<int> > Heap;
deba@1194: };
deba@1194: 
deba@1194: struct RadixTraits : public DijkstraDefaultTraits<Graph, LengthMap> {
deba@1194:   typedef RadixHeap<Graph::Node, Graph::NodeMap<int> > Heap;
deba@1194: };
deba@1194: 
deba@1194: 
deba@1194: int main(int argc, const char* argv[]) {
jacint@384:   
jacint@384: 
deba@1194:   Graph graph;
deba@1194:   Node s, t;
deba@1194:   LengthMap cap(graph);
deba@1194:   readDimacs(std::cin, graph, cap, s, t);
deba@1194:   Timer ts;
jacint@384: 
deba@1194:   GraphWriter<Graph> writer(std::cout, graph);
deba@1194: 
deba@1194:   IdMap<Graph, Node> nodeIdMap(graph);
deba@1194:   writer.addNodeMap("id", nodeIdMap);
deba@1194: 
deba@1194:   IdMap<Graph, Edge> edgeIdMap(graph);
deba@1194:   writer.addEdgeMap("id", edgeIdMap);
deba@1194: 
deba@1194:   writer.addEdgeMap("cap", cap);
deba@1194: 
deba@1194:   writer.run();
jacint@384:     
jacint@384:   std::cout <<
jacint@384:     "\n  Testing dijkstra.h with binary heap implementation bin_heap.h,"
jacint@384: 	    <<std::endl;
jacint@384:   std::cout<<"  on a graph with " << 
deba@1194:     countNodes(graph) << " nodes and " << countEdges(graph) << " edges..."
jacint@384: 	   << std::endl<<std::endl;
deba@1194: 
deba@1194: 
jacint@384:   Dijkstra<Graph, LengthMap> 
deba@1194:     dijkstra_test(graph, cap);
jacint@384:   ts.reset();
deba@1194:    dijkstra_test.run(s);
jacint@384:   std::cout << "elapsed time: " << ts << std::endl;
deba@1194: 
jacint@384:   int error1=0;
jacint@384:   int error2=0;
jacint@384: 
deba@1194:   for(EdgeIt e(graph); e!=INVALID; ++e) {
deba@1194:     Node u=graph.source(e); 
deba@1194:     Node v=graph.target(e);
jacint@384:     if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) > cap[e] )
jacint@384:       if ( dijkstra_test.reached(u) ) {
alpar@986: 	std::cout<<"Error! dist(target)-dist(source)- edge_length= " 
jacint@384: 		 <<dijkstra_test.dist(v) - dijkstra_test.dist(u) 
jacint@384: 	  - cap[e]<<std::endl;
jacint@384: 	++error1;
jacint@384:       }
jacint@384:   }
jacint@384: 
jacint@449:   NodeIt v;
deba@1194:   for(NodeIt v(graph); v!=INVALID; ++v) {
jacint@384:     if ( dijkstra_test.reached(v) ) {
jacint@384:       Edge e=dijkstra_test.pred(v);
alpar@1195:       if(e!=INVALID) {
alpar@1195: 	Node u=graph.source(e);
alpar@1195: 	if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) != cap[e] ) {
alpar@1195: 	  std::cout<<"Error in a shortest path tree edge! Difference: " 
alpar@1195: 		   <<std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) 
alpar@1195: 			      - cap[e])<<std::endl;
alpar@1195: 	  ++error2;
alpar@1195: 	}
jacint@384:       }
jacint@384:     }
jacint@384:   }
alpar@1195:   
jacint@384: 
jacint@384:   
jacint@384:   std::cout << error1 << " non-tree and " << error2 
jacint@384: 	    << " shortest path tree edge is erroneous."<<std::endl;
jacint@384: 
jacint@384: 
jacint@384: 
jacint@384:   std::cout <<
jacint@449:     "\n\n  Testing dijkstra.h with Fibonacci heap implementation fib_heap.h,"
jacint@384: 	    <<std::endl;
jacint@384:   std::cout<<"  on a graph with " << 
deba@1194:     countNodes(graph) << " nodes and " << countEdges(graph) << " edges..."
jacint@384: 	   << std::endl<<std::endl;
jacint@384:   
deba@1194: 
deba@1194:   Dijkstra<Graph, LengthMap, FibTraits> 
deba@1194:     dijkstra_test2(graph, cap);
jacint@384:   ts.reset();
jacint@384:   dijkstra_test2.run(s);
jacint@384:   std::cout << "elapsed time: " << ts << std::endl;
jacint@384:   
jacint@384:   error1=0;
jacint@384:   error2=0;
jacint@384: 
deba@1194:   for(EdgeIt e(graph); e!=INVALID; ++e) {
deba@1194:     Node u=graph.source(e);
deba@1194:     Node v=graph.target(e);
jacint@384:     if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) > cap[e] )
jacint@384:       if ( dijkstra_test2.reached(u) ) {
alpar@986: 	std::cout<<"Error! dist(target)-dist(source)- edge_length= " 
jacint@384: 		 <<dijkstra_test2.dist(v) - dijkstra_test2.dist(u) 
jacint@384: 	  - cap[e]<<std::endl;
jacint@384: 	++error1;
jacint@384:       }
jacint@384:   }
jacint@384: 
deba@1194:   for(NodeIt n(graph); v!=INVALID; ++v) {
jacint@384:     if ( dijkstra_test2.reached(v) ) {
jacint@384:       Edge e=dijkstra_test2.pred(v);
alpar@1195:       if(e!=INVALID) {
alpar@1195: 	Node u=graph.source(e);
alpar@1195: 	if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) != cap[e] ) {
alpar@1195: 	  std::cout<<"Error in a shortest path tree edge! Difference: " 
alpar@1195: 		   <<std::abs(dijkstra_test2.dist(v) - dijkstra_test2.dist(u) 
alpar@1195: 			      - cap[e])<<std::endl;
alpar@1195: 	  ++error2;
alpar@1195: 	}
jacint@384:       }
jacint@384:     }
jacint@384:   }
alpar@1195:   
jacint@384: 
jacint@384:   std::cout << error1 << " non-tree and " << error2 
jacint@384: 	    << " shortest path tree edge is erroneous."<<std::endl;
jacint@384: 
deba@1194:   std::cout <<
deba@1194:     "\n\n  Testing dijkstra.h with Radix heap implementation radix_heap.h,"
deba@1194: 	    <<std::endl;
deba@1194:   std::cout<<"  on a graph with " << 
deba@1194:     countNodes(graph) << " nodes and " << countEdges(graph) << " edges..."
deba@1194: 	   << std::endl<<std::endl;
deba@1194: 
deba@1194: 
deba@1194:   Dijkstra<Graph, LengthMap, RadixTraits> 
deba@1194:     dijkstra_test3(graph, cap);
deba@1194:   ts.reset();
deba@1194:   dijkstra_test3.run(s);
deba@1194:   std::cout << "elapsed time: " << ts << std::endl;
deba@1194:   
deba@1194: 
deba@1194:   error1=0;
deba@1194:   error2=0;
deba@1194: 
deba@1194:   for(EdgeIt e(graph); e!=INVALID; ++e) {
deba@1194:     Node u=graph.source(e);
deba@1194:     Node v=graph.target(e);
deba@1194:     if ( dijkstra_test3.dist(v) - dijkstra_test3.dist(u) > cap[e] )
deba@1194:       if ( dijkstra_test3.reached(u) ) {
deba@1194: 	std::cout<<"Error! dist(target)-dist(source)- edge_length= " 
deba@1194: 		 <<dijkstra_test3.dist(v) - dijkstra_test3.dist(u) 
deba@1194: 	  - cap[e]<<std::endl;
deba@1194: 	++error1;
deba@1194:       }
deba@1194:   }
deba@1194: 
deba@1194:   for(NodeIt n(graph); v!=INVALID; ++v) {
deba@1194:     if ( dijkstra_test3.reached(v) ) {
deba@1194:       Edge e=dijkstra_test3.pred(v);
alpar@1195:       if(e!=INVALID) {
alpar@1195: 	Node u=graph.source(e);
alpar@1195: 	if ( dijkstra_test3.dist(v) - dijkstra_test3.dist(u) != cap[e] ) {
alpar@1195: 	  std::cout<<"Error in a shortest path tree edge! Difference: " 
alpar@1195: 		   <<std::abs(dijkstra_test3.dist(v) - dijkstra_test3.dist(u) 
alpar@1195: 			      - cap[e])<<std::endl;
alpar@1195: 	  ++error2;
alpar@1195: 	}
deba@1194:       }
deba@1194:     }
deba@1194:   }
alpar@1195:   
deba@1194: 
deba@1194:   std::cout << error1 << " non-tree and " << error2 
deba@1194: 	    << " shortest path tree edge is erroneous."<<std::endl;
jacint@384: 
jacint@384:   return 0;
jacint@384: }