1.1 --- a/demo/dijkstra_demo.cc	Fri Jul 22 15:03:23 2005 +0000
     1.2 +++ b/demo/dijkstra_demo.cc	Fri Jul 22 15:15:29 2005 +0000
     1.3 @@ -1,3 +1,28 @@
     1.4 +/* -*- C++ -*-
     1.5 + * demo/lp_maxflow_demo.cc - Part of LEMON, a generic C++ optimization library
     1.6 + *
     1.7 + * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     1.8 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
     1.9 + *
    1.10 + * Permission to use, modify and distribute this software is granted
    1.11 + * provided that this copyright notice appears in all copies. For
    1.12 + * precise terms see the accompanying LICENSE file.
    1.13 + *
    1.14 + * This software is provided "AS IS" with no warranty of any kind,
    1.15 + * express or implied, and with no claim as to its suitability for any
    1.16 + * purpose.
    1.17 + *
    1.18 + */
    1.19 +
    1.20 +///\ingroup demos
    1.21 +///\file
    1.22 +///\brief Demonstrating LEMON implementation of the Dijkstra algorithm
    1.23 +///
    1.24 +/// Dijkstra's algorithm computes shortest paths between two nodes in
    1.25 +/// a graph with edge lengths. Here we only show some of the
    1.26 +/// facilities supplied by our implementation: for the detailed
    1.27 +/// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this".
    1.28 +
    1.29  #include <iostream>
    1.30  
    1.31  #include <lemon/list_graph.h>
    1.32 @@ -51,7 +76,7 @@
    1.33  
    1.34      std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
    1.35  
    1.36 -    std::cout << "Dijkstra algorithm test..." << std::endl;
    1.37 +    std::cout << "Dijkstra algorithm demo..." << std::endl;
    1.38  
    1.39  
    1.40      Dijkstra<Graph, LengthMap> dijkstra_test(g,len);