Changeset 280:e7f8647ce760 in lemon-1.2
- Timestamp:
- 07/14/08 16:23:11 (16 years ago)
- Branch:
- default
- Phase:
- public
- Location:
- lemon
- Files:
-
- 15 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bfs.h
r258 r280 54 54 ///\param g is the digraph, to which we would like to define the 55 55 ///\ref PredMap. 56 ///\todo The digraph alone may be insufficient to initialize57 56 static PredMap *createPredMap(const Digraph &g) 58 57 { … … 64 63 ///The type of the map that indicates which nodes are processed. 65 64 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 66 ///By default it is a NullMap.67 65 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 68 66 ///Instantiates a \ref ProcessedMap. … … 196 194 int _curr_dist; 197 195 198 ///Creates the maps if necessary. 199 ///\todo Better memory allocation (instead of new). 196 //Creates the maps if necessary. 200 197 void create_maps() 201 198 { … … 848 845 ///\param g is the digraph, to which we would like to define the 849 846 ///\ref PredMap. 850 ///\todo The digraph alone may be insufficient to initialize851 847 #ifdef DOXYGEN 852 848 static PredMap *createPredMap(const Digraph &g) … … 1333 1329 int _list_front, _list_back; 1334 1330 1335 ///Creates the maps if necessary. 1336 ///\todo Better memory allocation (instead of new). 1331 //Creates the maps if necessary. 1337 1332 void create_maps() { 1338 1333 if(!_reached) { -
lemon/bits/base_extender.h
r256 r280 106 106 /// Returns whether the given directed arc has the same orientation 107 107 /// as the corresponding edge. 108 ///109 /// \todo reference to the corresponding point of the undirected digraph110 /// concept. "What does the direction of an edge mean?"111 108 static bool direction(const Arc &a) { return a.forward; } 112 109 -
lemon/bits/vector_map.h
r263 r280 43 43 /// the map. This map type uses the std::vector to store the values. 44 44 /// 45 /// \tparam _ Notifier The AlterationNotifier that will notify this map.45 /// \tparam _Graph The graph this map is attached to. 46 46 /// \tparam _Item The item type of the graph items. 47 47 /// \tparam _Value The value type of the map. 48 /// \todo Fix the doc: there is _Graph parameter instead of _Notifier.49 48 template <typename _Graph, typename _Item, typename _Value> 50 49 class VectorMap -
lemon/concept_check.h
r209 r280 37 37 ///\brief Basic utilities for concept checking. 38 38 /// 39 ///\todo Are we still using BOOST concept checking utility?40 ///Is the BOOST copyright notice necessary?41 39 42 40 #ifndef LEMON_CONCEPT_CHECK_H -
lemon/concepts/path.h
r236 r280 21 21 ///\brief Classes for representing paths in digraphs. 22 22 /// 23 ///\todo Iterators have obsolete style24 23 25 24 #ifndef LEMON_CONCEPT_PATH_H -
lemon/dfs.h
r258 r280 55 55 ///\param g is the digraph, to which we would like to define the 56 56 ///\ref PredMap. 57 ///\todo The digraph alone may be insufficient to initialize58 57 static PredMap *createPredMap(const Digraph &g) 59 58 { … … 65 64 ///The type of the map that indicates which nodes are processed. 66 65 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 67 ///By default it is a NullMap.68 66 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 69 67 ///Instantiates a \ref ProcessedMap. … … 196 194 int _stack_head; 197 195 198 ///Creates the maps if necessary. 199 ///\todo Better memory allocation (instead of new). 196 //Creates the maps if necessary. 200 197 void create_maps() 201 198 { … … 783 780 ///\param g is the digraph, to which we would like to define the 784 781 ///\ref PredMap. 785 ///\todo The digraph alone may be insufficient to initialize786 782 #ifdef DOXYGEN 787 783 static PredMap *createPredMap(const Digraph &g) … … 1280 1276 int _stack_head; 1281 1277 1282 ///Creates the maps if necessary. 1283 ///\todo Better memory allocation (instead of new). 1278 //Creates the maps if necessary. 1284 1279 void create_maps() { 1285 1280 if(!_reached) { -
lemon/dijkstra.h
r258 r280 144 144 ///\param g is the digraph, to which we would like to define the 145 145 ///\ref PredMap. 146 ///\todo The digraph alone may be insufficient for the initialization147 146 static PredMap *createPredMap(const Digraph &g) 148 147 { … … 155 154 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 156 155 ///By default it is a NullMap. 157 ///\todo If it is set to a real map,158 ///Dijkstra::processed() should read this.159 156 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 160 157 ///Instantiates a \ref ProcessedMap. … … 297 294 bool local_heap; 298 295 299 ///Creates the maps if necessary. 300 ///\todo Better memory allocation (instead of new). 296 //Creates the maps if necessary. 301 297 void create_maps() 302 298 { … … 958 954 /// \param g is the digraph, to which we would like to define the 959 955 /// HeapCrossRef. 960 /// \todo The digraph alone may be insufficient for the initialization961 956 static HeapCrossRef *createHeapCrossRef(const Digraph &g) 962 957 { … … 994 989 ///\param g is the digraph, to which we would like to define the 995 990 ///\ref PredMap. 996 ///\todo The digraph alone may be insufficient to initialize997 991 #ifdef DOXYGEN 998 992 static PredMap *createPredMap(const Digraph &g) … … 1009 1003 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 1010 1004 ///By default it is a NullMap. 1011 ///\todo If it is set to a real map,1012 ///Dijkstra::processed() should read this.1013 ///\todo named parameter to set this type, function to read and write.1014 1005 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 1015 1006 ///Instantiates a \ref ProcessedMap. … … 1055 1046 /// The \ref DijkstraWizardBase is a class to be the default traits of the 1056 1047 /// \ref DijkstraWizard class. 1057 /// \todo More named parameters are required...1058 1048 template<class GR,class LM> 1059 1049 class DijkstraWizardBase : public DijkstraWizardDefaultTraits<GR,LM> -
lemon/error.h
r212 r280 103 103 ///\e 104 104 105 ///\todo The good solution is boost::shared_ptr...106 ///107 105 mutable std::auto_ptr<std::ostringstream> buf; 108 106 -
lemon/graph_to_eps.h
r253 r280 667 667 ///it draws the graph. 668 668 void run() { 669 //\todo better 'epsilon' would be nice here.670 669 const double EPSILON=1e-9; 671 670 if(dontPrint) return; … … 708 707 for(ArcIt e(g);e!=INVALID;++e) 709 708 max_w=std::max(double(_arcWidths[e]),max_w); 710 //\todo better 'epsilon' would be nice here.711 709 if(max_w>EPSILON) { 712 710 _arcWidthScale/=max_w; … … 718 716 for(NodeIt n(g);n!=INVALID;++n) 719 717 max_s=std::max(double(_nodeSizes[n]),max_s); 720 //\todo better 'epsilon' would be nice here.721 718 if(max_s>EPSILON) { 722 719 _nodeScale/=max_s; … … 874 871 } 875 872 else { 876 //\todo Verify centering877 873 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(), 878 874 (A4WIDTH-2*A4BORDER)/bb.height()); … … 907 903 dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]); 908 904 double l=std::sqrt(dvec.normSquare()); 909 //\todo better 'epsilon' would be nice here.910 905 dim2::Point<double> d(dvec/std::max(l,EPSILON)); 911 906 dim2::Point<double> m; -
lemon/list_graph.h
r239 r280 502 502 ///be invalidated. 503 503 /// 504 ///\warning This functionality cannot be used togetherwith the504 ///\warning This functionality cannot be used in conjunction with the 505 505 ///Snapshot feature. 506 ///507 ///\todo It could be implemented in a bit faster way.508 506 Node split(Node n, bool connect = true) { 509 507 Node b = addNode(); -
lemon/maps.h
r220 r280 485 485 /// 486 486 /// \sa CombineMap 487 ///488 /// \todo Check the requirements.489 487 template <typename M1, typename M2> 490 488 class ComposeMap : public MapBase<typename M2::Key, typename M1::Value> { … … 541 539 /// 542 540 /// \sa ComposeMap 543 ///544 /// \todo Check the requirements.545 541 template<typename M1, typename M2, typename F, 546 542 typename V = typename F::result_type> -
lemon/random.h
r209 r280 822 822 /// \note The Cartesian form of the Box-Muller 823 823 /// transformation is used to generate a random normal distribution. 824 /// \todo Consider using the "ziggurat" method instead.825 824 double gauss() 826 825 { -
lemon/smart_graph.h
r238 r280 301 301 ///\warning This functionality cannot be used together with the Snapshot 302 302 ///feature. 303 ///\todo It could be implemented in a bit faster way.304 303 Node split(Node n, bool connect = true) 305 304 { -
lemon/time_measure.h
r210 r280 293 293 ///function, consider the usage of \ref TimeReport instead. 294 294 /// 295 ///\todo This shouldn't be Unix (Linux) specific.296 295 ///\sa TimeReport 297 296 class Timer … … 488 487 ///\sa Timer 489 488 ///\sa NoTimeReport 490 ///\todo There is no test case for this491 489 class TimeReport : public Timer 492 490 { -
lemon/tolerance.h
r209 r280 25 25 ///floating point numbers. 26 26 /// 27 ///\todo It should be in a module like "Basic tools"28 29 27 30 28 namespace lemon {
Note: See TracChangeset
for help on using the changeset viewer.