Changeset 2367:041878e6f388 in lemon-0.x for demo/csp_demo.cc

Timestamp:

02/19/07 10:55:43 (17 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3182

Message:

More adequate doc.

File:

• demo/csp_demo.cc (modified) (2 diffs)

demo/csp_demo.cc

@@ -19 +19 @@
 ///\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>
@@ -67 +63 @@
     
     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;