1.1 --- a/lemon/bfs.h Mon Sep 22 10:56:01 2008 +0200
1.2 +++ b/lemon/bfs.h Mon Jul 14 15:23:11 2008 +0100
1.3 @@ -53,7 +53,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 @@ -63,7 +62,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 @@ -195,8 +193,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 @@ -847,7 +844,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 #ifdef DOXYGEN
1.35 static PredMap *createPredMap(const Digraph &g)
1.36 #else
1.37 @@ -1332,8 +1328,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;