Changes in / [281:e9b4fbe163f5:279:6307bbbf285b] in lemon-1.1
- Location:
- lemon
- Files:
-
- 15 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bfs.h
r281 r278 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 initialize 57 58 static PredMap *createPredMap(const Digraph &g) 58 59 { … … 64 65 ///The type of the map that indicates which nodes are processed. 65 66 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 67 ///By default it is a NullMap. 66 68 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 67 69 ///Instantiates a \ref ProcessedMap. … … 195 197 int _curr_dist; 196 198 197 //Creates the maps if necessary. 199 ///Creates the maps if necessary. 200 ///\todo Better memory allocation (instead of new). 198 201 void create_maps() 199 202 { … … 846 849 ///\param g is the digraph, to which we would like to define the 847 850 ///\ref PredMap. 851 ///\todo The digraph alone may be insufficient to initialize 848 852 static PredMap *createPredMap(const Digraph &g) 849 853 { … … 1367 1371 int _list_front, _list_back; 1368 1372 1369 //Creates the maps if necessary. 1373 ///Creates the maps if necessary. 1374 ///\todo Better memory allocation (instead of new). 1370 1375 void create_maps() { 1371 1376 if(!_reached) { -
lemon/bits/base_extender.h
r280 r256 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 digraph 110 /// concept. "What does the direction of an edge mean?" 108 111 static bool direction(const Arc &a) { return a.forward; } 109 112 -
lemon/bits/vector_map.h
r280 r263 43 43 /// the map. This map type uses the std::vector to store the values. 44 44 /// 45 /// \tparam _ Graph The graph this map is attached to.45 /// \tparam _Notifier The AlterationNotifier that will notify this map. 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. 48 49 template <typename _Graph, typename _Item, typename _Value> 49 50 class VectorMap -
lemon/concept_check.h
r280 r209 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? 39 41 40 42 #ifndef LEMON_CONCEPT_CHECK_H -
lemon/concepts/path.h
r281 r278 21 21 ///\brief Classes for representing paths in digraphs. 22 22 /// 23 ///\todo Iterators have obsolete style 23 24 24 25 #ifndef LEMON_CONCEPT_PATH_H -
lemon/dfs.h
r281 r278 56 56 ///\param g is the digraph, to which we would like to define the 57 57 ///\ref PredMap. 58 ///\todo The digraph alone may be insufficient to initialize 58 59 static PredMap *createPredMap(const Digraph &g) 59 60 { … … 65 66 ///The type of the map that indicates which nodes are processed. 66 67 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 68 ///By default it is a NullMap. 67 69 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 68 70 ///Instantiates a \ref ProcessedMap. … … 195 197 int _stack_head; 196 198 197 //Creates the maps if necessary. 199 ///Creates the maps if necessary. 200 ///\todo Better memory allocation (instead of new). 198 201 void create_maps() 199 202 { … … 780 783 ///\param g is the digraph, to which we would like to define the 781 784 ///\ref PredMap. 785 ///\todo The digraph alone may be insufficient to initialize 782 786 static PredMap *createPredMap(const Digraph &g) 783 787 { … … 1314 1318 int _stack_head; 1315 1319 1316 //Creates the maps if necessary. 1320 ///Creates the maps if necessary. 1321 ///\todo Better memory allocation (instead of new). 1317 1322 void create_maps() { 1318 1323 if(!_reached) { -
lemon/dijkstra.h
r281 r278 145 145 ///\param g is the digraph, to which we would like to define the 146 146 ///\ref PredMap. 147 ///\todo The digraph alone may be insufficient for the initialization 147 148 static PredMap *createPredMap(const Digraph &g) 148 149 { … … 155 156 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 156 157 ///By default it is a NullMap. 158 ///\todo If it is set to a real map, 159 ///Dijkstra::processed() should read this. 157 160 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 158 161 ///Instantiates a \ref ProcessedMap. … … 295 298 bool local_heap; 296 299 297 //Creates the maps if necessary. 300 ///Creates the maps if necessary. 301 ///\todo Better memory allocation (instead of new). 298 302 void create_maps() 299 303 { … … 955 959 /// \param g is the digraph, to which we would like to define the 956 960 /// HeapCrossRef. 961 /// \todo The digraph alone may be insufficient for the initialization 957 962 static HeapCrossRef *createHeapCrossRef(const Digraph &g) 958 963 { … … 990 995 ///\param g is the digraph, to which we would like to define the 991 996 ///\ref PredMap. 997 ///\todo The digraph alone may be insufficient to initialize 992 998 static PredMap *createPredMap(const Digraph &g) 993 999 { … … 1000 1006 ///It must meet the \ref concepts::WriteMap "WriteMap" concept. 1001 1007 ///By default it is a NullMap. 1008 ///\todo If it is set to a real map, 1009 ///Dijkstra::processed() should read this. 1010 ///\todo named parameter to set this type, function to read and write. 1002 1011 typedef NullMap<typename Digraph::Node,bool> ProcessedMap; 1003 1012 ///Instantiates a \ref ProcessedMap. … … 1045 1054 /// The \ref DijkstraWizardBase is a class to be the default traits of the 1046 1055 /// \ref DijkstraWizard class. 1056 /// \todo More named parameters are required... 1047 1057 template<class GR,class LM> 1048 1058 class DijkstraWizardBase : public DijkstraWizardDefaultTraits<GR,LM> -
lemon/error.h
r280 r212 103 103 ///\e 104 104 105 ///\todo The good solution is boost::shared_ptr... 106 /// 105 107 mutable std::auto_ptr<std::ostringstream> buf; 106 108 -
lemon/graph_to_eps.h
r280 r253 667 667 ///it draws the graph. 668 668 void run() { 669 //\todo better 'epsilon' would be nice here. 669 670 const double EPSILON=1e-9; 670 671 if(dontPrint) return; … … 707 708 for(ArcIt e(g);e!=INVALID;++e) 708 709 max_w=std::max(double(_arcWidths[e]),max_w); 710 //\todo better 'epsilon' would be nice here. 709 711 if(max_w>EPSILON) { 710 712 _arcWidthScale/=max_w; … … 716 718 for(NodeIt n(g);n!=INVALID;++n) 717 719 max_s=std::max(double(_nodeSizes[n]),max_s); 720 //\todo better 'epsilon' would be nice here. 718 721 if(max_s>EPSILON) { 719 722 _nodeScale/=max_s; … … 871 874 } 872 875 else { 876 //\todo Verify centering 873 877 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(), 874 878 (A4WIDTH-2*A4BORDER)/bb.height()); … … 903 907 dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]); 904 908 double l=std::sqrt(dvec.normSquare()); 909 //\todo better 'epsilon' would be nice here. 905 910 dim2::Point<double> d(dvec/std::max(l,EPSILON)); 906 911 dim2::Point<double> m; -
lemon/list_graph.h
r280 r239 502 502 ///be invalidated. 503 503 /// 504 ///\warning This functionality cannot be used in conjunctionwith the504 ///\warning This functionality cannot be used together with the 505 505 ///Snapshot feature. 506 /// 507 ///\todo It could be implemented in a bit faster way. 506 508 Node split(Node n, bool connect = true) { 507 509 Node b = addNode(); -
lemon/maps.h
r280 r220 485 485 /// 486 486 /// \sa CombineMap 487 /// 488 /// \todo Check the requirements. 487 489 template <typename M1, typename M2> 488 490 class ComposeMap : public MapBase<typename M2::Key, typename M1::Value> { … … 539 541 /// 540 542 /// \sa ComposeMap 543 /// 544 /// \todo Check the requirements. 541 545 template<typename M1, typename M2, typename F, 542 546 typename V = typename F::result_type> -
lemon/random.h
r280 r209 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. 824 825 double gauss() 825 826 { -
lemon/smart_graph.h
r280 r238 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. 303 304 Node split(Node n, bool connect = true) 304 305 { -
lemon/time_measure.h
r280 r210 293 293 ///function, consider the usage of \ref TimeReport instead. 294 294 /// 295 ///\todo This shouldn't be Unix (Linux) specific. 295 296 ///\sa TimeReport 296 297 class Timer … … 487 488 ///\sa Timer 488 489 ///\sa NoTimeReport 490 ///\todo There is no test case for this 489 491 class TimeReport : public Timer 490 492 { -
lemon/tolerance.h
r280 r209 25 25 ///floating point numbers. 26 26 /// 27 ///\todo It should be in a module like "Basic tools" 28 27 29 28 30 namespace lemon {
Note: See TracChangeset
for help on using the changeset viewer.