diff -r 5fd89def7cbc -r 2b329fd595ef demo/dijkstra_demo.cc
--- a/demo/dijkstra_demo.cc	Fri Jul 22 15:03:23 2005 +0000
+++ b/demo/dijkstra_demo.cc	Fri Jul 22 15:15:29 2005 +0000
@@ -1,3 +1,28 @@
+/* -*- C++ -*-
+ * demo/lp_maxflow_demo.cc - Part of LEMON, a generic C++ optimization library
+ *
+ * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
+ * (Egervary Research Group on Combinatorial Optimization, EGRES).
+ *
+ * Permission to use, modify and distribute this software is granted
+ * provided that this copyright notice appears in all copies. For
+ * precise terms see the accompanying LICENSE file.
+ *
+ * This software is provided "AS IS" with no warranty of any kind,
+ * express or implied, and with no claim as to its suitability for any
+ * purpose.
+ *
+ */
+
+///\ingroup demos
+///\file
+///\brief Demonstrating LEMON implementation of the Dijkstra algorithm
+///
+/// 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 <iostream>
 
 #include <lemon/list_graph.h>
@@ -51,7 +76,7 @@
 
     std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
 
-    std::cout << "Dijkstra algorithm test..." << std::endl;
+    std::cout << "Dijkstra algorithm demo..." << std::endl;
 
 
     Dijkstra<Graph, LengthMap> dijkstra_test(g,len);