[Lemon-commits] alpar: r3182 - hugo/trunk/demo

[Lemon SVN]

Author: alpar
Date: Mon Feb 19 10:55:43 2007
New Revision: 3182

Modified:
   hugo/trunk/demo/csp_demo.cc

Log:
More adequate doc.

Modified: hugo/trunk/demo/csp_demo.cc
==============================================================================
--- hugo/trunk/demo/csp_demo.cc	(original)
+++ hugo/trunk/demo/csp_demo.cc	Mon Feb 19 10:55:43 2007
@@ -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 << ": ";