1.1 --- a/lemon/kruskal.h	Mon Jun 26 15:40:35 2006 +0000
     1.2 +++ b/lemon/kruskal.h	Wed Jun 28 15:06:24 2006 +0000
     1.3 @@ -44,7 +44,7 @@
     1.4    /// Due to hard C++ hacking, it accepts various input and output types.
     1.5    ///
     1.6    /// \param g The graph the algorithm runs on.
     1.7 -  /// It can be either \ref concept::StaticGraph "directed" or 
     1.8 +  /// It can be either \ref concept::Graph "directed" or 
     1.9    /// \ref concept::UGraph "undirected".
    1.10    /// If the graph is directed, the algorithm consider it to be 
    1.11    /// undirected by disregarding the direction of the edges.