1.1 --- a/lemon/dijkstra.h	Mon Jun 26 15:40:35 2006 +0000
     1.2 +++ b/lemon/dijkstra.h	Wed Jun 28 15:06:24 2006 +0000
     1.3 @@ -157,7 +157,7 @@
     1.4    ///edges. It is read once for each edge, so the map may involve in
     1.5    ///relatively time consuming process to compute the edge length if
     1.6    ///it is necessary. The default map type is \ref
     1.7 -  ///concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>".  The value
     1.8 +  ///concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
     1.9    ///of LM is not used directly by Dijkstra, it is only passed to \ref
    1.10    ///DijkstraDefaultTraits.  \param TR Traits class to set
    1.11    ///various data types used by the algorithm.  The default traits