1.1 --- a/demo/csp_demo.cc	Fri Feb 16 19:11:31 2007 +0000
     1.2 +++ b/demo/csp_demo.cc	Mon Feb 19 09:55:43 2007 +0000
     1.3 @@ -18,14 +18,10 @@
     1.4  
     1.5  ///\ingroup demos
     1.6  ///\file
     1.7 -///\brief Demonstrating the usage of LEMON's Dijkstra algorithm
     1.8 +///\brief Demonstrating the usage of LEMON's algorithm for solving the
     1.9 +/// Constrained shortest Path Problem 
    1.10  ///
    1.11 -/// Dijkstra's algorithm computes shortest paths between two nodes in
    1.12 -/// a graph with edge lengths. Here we only show some of the
    1.13 -/// facilities supplied by our implementation: for the detailed
    1.14 -/// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this".
    1.15 -///
    1.16 -/// \include dijkstra_demo.cc
    1.17 +/// \include csp_demo.cc
    1.18  
    1.19  #include <iostream>
    1.20  #include <lemon/list_graph.h>
    1.21 @@ -66,7 +62,7 @@
    1.22        }
    1.23      
    1.24      ConstrainedShortestPath<Graph,LengthMap,LengthMap> csp(g,cost,delay);
    1.25 -    for(double d=0;d<2;d+=.01)
    1.26 +    for(double d=0;d<2;d+=.001)
    1.27        {
    1.28  	double lo_bo;
    1.29  	std::cout << d << ": ";