1.1 --- a/lemon/kruskal.h	Tue Aug 16 16:44:57 2005 +0000
     1.2 +++ b/lemon/kruskal.h	Tue Aug 16 19:06:59 2005 +0000
     1.3 @@ -51,7 +51,7 @@
     1.4    ///
     1.5    /// \param g The graph the algorithm runs on.
     1.6    /// It can be either \ref concept::StaticGraph "directed" or 
     1.7 -  /// \ref concept::UndirStaticGraph "undirected".
     1.8 +  /// \ref concept::UndirGraph "undirected".
     1.9    /// If the graph is directed, the algorithm consider it to be 
    1.10    /// undirected by disregarding the direction of the edges.
    1.11    ///
    1.12 @@ -88,7 +88,8 @@
    1.13    ///
    1.14    /// \return The cost of the found tree.
    1.15    ///
    1.16 -  /// \warning If kruskal is run on an \ref undirected graph, be sure that the
    1.17 +  /// \warning If kruskal is run on an
    1.18 +  /// \ref lemon::concept::UndirGraph "undirected graph", be sure that the
    1.19    /// map storing the tree is also undirected
    1.20    /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the
    1.21    /// half of the edges will not be set.