1.1 --- a/lemon/dijkstra.h	Fri Sep 26 12:40:11 2008 +0200
     1.2 +++ b/lemon/dijkstra.h	Sat Sep 27 14:33:28 2008 +0200
     1.3 @@ -144,7 +144,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 for the initialization
     1.8      static PredMap *createPredMap(const Digraph &g)
     1.9      {
    1.10        return new PredMap(g);
    1.11 @@ -155,8 +154,6 @@
    1.12      ///The type of the map that indicates which nodes are processed.
    1.13      ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.14      ///By default it is a NullMap.
    1.15 -    ///\todo If it is set to a real map,
    1.16 -    ///Dijkstra::processed() should read this.
    1.17      typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    1.18      ///Instantiates a \ref ProcessedMap.
    1.19  
    1.20 @@ -297,8 +294,7 @@
    1.21      //Indicates if _heap is locally allocated (true) or not.
    1.22      bool local_heap;
    1.23  
    1.24 -    ///Creates the maps if necessary.
    1.25 -    ///\todo Better memory allocation (instead of new).
    1.26 +    //Creates the maps if necessary.
    1.27      void create_maps()
    1.28      {
    1.29        if(!_pred) {
    1.30 @@ -965,7 +961,6 @@
    1.31      ///This function instantiates a \ref HeapCrossRef.
    1.32      /// \param g is the digraph, to which we would like to define the
    1.33      /// HeapCrossRef.
    1.34 -    /// \todo The digraph alone may be insufficient for the initialization
    1.35      static HeapCrossRef *createHeapCrossRef(const Digraph &g)
    1.36      {
    1.37        return new HeapCrossRef(g);
    1.38 @@ -1001,7 +996,6 @@
    1.39      ///This function instantiates a \ref PredMap.
    1.40      ///\param g is the digraph, to which we would like to define the
    1.41      ///\ref PredMap.
    1.42 -    ///\todo The digraph alone may be insufficient to initialize
    1.43      static PredMap *createPredMap(const Digraph &g)
    1.44      {
    1.45        return new PredMap(g);
    1.46 @@ -1012,9 +1006,6 @@
    1.47      ///The type of the map that indicates which nodes are processed.
    1.48      ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.49      ///By default it is a NullMap.
    1.50 -    ///\todo If it is set to a real map,
    1.51 -    ///Dijkstra::processed() should read this.
    1.52 -    ///\todo named parameter to set this type, function to read and write.
    1.53      typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    1.54      ///Instantiates a \ref ProcessedMap.
    1.55  
    1.56 @@ -1060,7 +1051,6 @@
    1.57    /// as well as the \ref Dijkstra class.
    1.58    /// The \ref DijkstraWizardBase is a class to be the default traits of the
    1.59    /// \ref DijkstraWizard class.
    1.60 -  /// \todo More named parameters are required...
    1.61    template<class GR,class LM>
    1.62    class DijkstraWizardBase : public DijkstraWizardDefaultTraits<GR,LM>
    1.63    {