1.1 --- a/lemon/bfs.h	Fri Sep 26 13:46:49 2008 +0200
     1.2 +++ b/lemon/bfs.h	Sat Sep 27 13:45:50 2008 +0200
     1.3 @@ -54,7 +54,6 @@
     1.4      ///This function instantiates a \ref PredMap.
     1.5      ///\param g is the digraph, to which we would like to define the
     1.6      ///\ref PredMap.
     1.7 -    ///\todo The digraph alone may be insufficient to initialize
     1.8      static PredMap *createPredMap(const Digraph &g)
     1.9      {
    1.10        return new PredMap(g);
    1.11 @@ -64,7 +63,6 @@
    1.12  
    1.13      ///The type of the map that indicates which nodes are processed.
    1.14      ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.15 -    ///By default it is a NullMap.
    1.16      typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    1.17      ///Instantiates a \ref ProcessedMap.
    1.18  
    1.19 @@ -196,8 +194,7 @@
    1.20      int _queue_head,_queue_tail,_queue_next_dist;
    1.21      int _curr_dist;
    1.22  
    1.23 -    ///Creates the maps if necessary.
    1.24 -    ///\todo Better memory allocation (instead of new).
    1.25 +    //Creates the maps if necessary.
    1.26      void create_maps()
    1.27      {
    1.28        if(!_pred) {
    1.29 @@ -848,7 +845,6 @@
    1.30      ///This function instantiates a \ref PredMap.
    1.31      ///\param g is the digraph, to which we would like to define the
    1.32      ///\ref PredMap.
    1.33 -    ///\todo The digraph alone may be insufficient to initialize
    1.34      static PredMap *createPredMap(const Digraph &g)
    1.35      {
    1.36        return new PredMap(g);
    1.37 @@ -1370,8 +1366,7 @@
    1.38      std::vector<typename Digraph::Node> _list;
    1.39      int _list_front, _list_back;
    1.40  
    1.41 -    ///Creates the maps if necessary.
    1.42 -    ///\todo Better memory allocation (instead of new).
    1.43 +    //Creates the maps if necessary.
    1.44      void create_maps() {
    1.45        if(!_reached) {
    1.46          local_reached = true;