COIN-OR::LEMON - Graph Library

Changeset 2367:041878e6f388 in lemon-0.x


Ignore:
Timestamp:
02/19/07 10:55:43 (11 years ago)
Author:
alpar
Branch:
default
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3182
Message:

More adequate doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/csp_demo.cc

    r2360 r2367  
    1919///\ingroup demos 
    2020///\file 
    21 ///\brief Demonstrating the usage of LEMON's Dijkstra algorithm 
     21///\brief Demonstrating the usage of LEMON's algorithm for solving the 
     22/// Constrained shortest Path Problem  
    2223/// 
    23 /// Dijkstra's algorithm computes shortest paths between two nodes in 
    24 /// a graph with edge lengths. Here we only show some of the 
    25 /// facilities supplied by our implementation: for the detailed 
    26 /// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this". 
    27 /// 
    28 /// \include dijkstra_demo.cc 
     24/// \include csp_demo.cc 
    2925 
    3026#include <iostream> 
     
    6763     
    6864    ConstrainedShortestPath<Graph,LengthMap,LengthMap> csp(g,cost,delay); 
    69     for(double d=0;d<2;d+=.01) 
     65    for(double d=0;d<2;d+=.001) 
    7066      { 
    7167        double lo_bo; 
Note: See TracChangeset for help on using the changeset viewer.