1.1 --- a/demo/dijkstra_demo.cc	Mon Jul 04 07:51:57 2005 +0000
     1.2 +++ b/demo/dijkstra_demo.cc	Mon Jul 04 13:08:31 2005 +0000
     1.3 @@ -44,6 +44,11 @@
     1.4      len.set(v4_t, 8);
     1.5      len.set(v5_t, 8);
     1.6  
     1.7 +    std::cout << "This program is a simple demo of the LEMON Dijkstra class."<<std::endl;
     1.8 +    std::cout << "We calculate the shortest path from node s to node t in a graph."<<std::endl;
     1.9 +    std::cout <<std::endl;
    1.10 +
    1.11 +
    1.12      std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
    1.13  
    1.14      std::cout << "Dijkstra algorithm test..." << std::endl;