# HG changeset patch
# User alpar
# Date 1171878943 0
# Node ID 041878e6f3885aca45b3f2a25767cb0c45d083d8
# Parent  bfbdded3763ae2062ee654ec15a01fc279671c5a
More adequate doc.

diff -r bfbdded3763a -r 041878e6f388 demo/csp_demo.cc
--- a/demo/csp_demo.cc	Fri Feb 16 19:11:31 2007 +0000
+++ b/demo/csp_demo.cc	Mon Feb 19 09:55:43 2007 +0000
@@ -18,14 +18,10 @@
 
 ///\ingroup demos
 ///\file
-///\brief Demonstrating the usage of LEMON's Dijkstra algorithm
+///\brief Demonstrating the usage of LEMON's algorithm for solving the
+/// Constrained shortest Path Problem 
 ///
-/// Dijkstra's algorithm computes shortest paths between two nodes in
-/// a graph with edge lengths. Here we only show some of the
-/// facilities supplied by our implementation: for the detailed
-/// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this".
-///
-/// \include dijkstra_demo.cc
+/// \include csp_demo.cc
 
 #include <iostream>
 #include <lemon/list_graph.h>
@@ -66,7 +62,7 @@
       }
     
     ConstrainedShortestPath<Graph,LengthMap,LengthMap> csp(g,cost,delay);
-    for(double d=0;d<2;d+=.01)
+    for(double d=0;d<2;d+=.001)
       {
 	double lo_bo;
 	std::cout << d << ": ";