1.1 --- a/lemon/bfs.h Sun Jul 13 19:51:02 2008 +0100
1.2 +++ b/lemon/bfs.h Sun Jul 13 20:09:47 2008 +0100
1.3 @@ -103,7 +103,8 @@
1.4 ///Instantiates a DistMap.
1.5
1.6 ///This function instantiates a \ref DistMap.
1.7 - ///\param G is the digraph, to which we would like to define the \ref DistMap
1.8 + ///\param G is the digraph, to which we would like to define
1.9 + ///the \ref DistMap
1.10 static DistMap *createDistMap(const GR &G)
1.11 {
1.12 return new DistMap(G);
1.13 @@ -825,7 +826,8 @@
1.14 ///Instantiates a DistMap.
1.15
1.16 ///This function instantiates a \ref DistMap.
1.17 - ///\param g is the digraph, to which we would like to define the \ref DistMap
1.18 + ///\param g is the digraph, to which we would like to define
1.19 + ///the \ref DistMap
1.20 #ifdef DOXYGEN
1.21 static DistMap *createDistMap(const GR &g)
1.22 #else
1.23 @@ -1199,7 +1201,8 @@
1.24 /// class. It works with callback mechanism, the BfsVisit object calls
1.25 /// on every bfs event the \c Visitor class member functions.
1.26 ///
1.27 - /// \tparam _Digraph The digraph type the algorithm runs on. The default value is
1.28 + /// \tparam _Digraph The digraph type the algorithm runs on.
1.29 + /// The default value is
1.30 /// \ref ListDigraph. The value of _Digraph is not used directly by Bfs, it
1.31 /// is only passed to \ref BfsDefaultTraits.
1.32 /// \tparam _Visitor The Visitor object for the algorithm. The