Changeset 1953:d4f411003580 in lemon-0.x for lemon
- Timestamp:
- 02/03/06 16:58:24 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2528
- Location:
- lemon
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/fredman_tarjan.h
r1946 r1953 457 457 ///Sets the TreeMap of the edges of the minimum spanning tree. 458 458 ///The map values belonging to the edges of the minimum 459 ///spanning tree are set to \ paramtree_edge_value or \c true by default459 ///spanning tree are set to \c tree_edge_value or \c true by default 460 460 ///while the edge values not belonging to the minimum spanning tree are 461 461 ///set to 462 ///\ paramtree_default_value or \c false by default.462 ///\c tree_default_value or \c false by default. 463 463 /// 464 464 ///\pre \ref run() or \ref start() must be called before using this -
lemon/iterable_maps.h
r1931 r1953 200 200 /// Creates an iterator. It iterates on the 201 201 /// keys which mapped to true. 202 /// \param map The IterableIntMap202 /// \param _map The IterableIntMap 203 203 TrueIt(const IterableBoolMap& _map) 204 204 : Parent(_map.sep > 0 ? _map.array[_map.sep - 1] : INVALID), … … 240 240 /// Creates an iterator. It iterates on the 241 241 /// keys which mapped to false. 242 /// \param map The IterableIntMap242 /// \param _map The IterableIntMap 243 243 FalseIt(const IterableBoolMap& _map) 244 244 : Parent(_map.sep < (int)_map.array.size() ? … … 279 279 /// Creates an iterator. It iterates on the 280 280 /// keys which mapped to false. 281 /// \param map The IterableIntMap281 /// \param _map The IterableIntMap 282 282 /// \param value Which elements should be iterated. 283 283 ItemIt(const IterableBoolMap& _map, bool value) -
lemon/johnson.h
r1946 r1953 152 152 /// 153 153 /// This function instantiates a \ref PredMap. 154 /// \param Gis the graph, to which we would like to define the PredMap.154 /// \param graph is the graph, to which we would like to define the PredMap. 155 155 /// \todo The graph alone may be insufficient for the initialization 156 156 static PredMap *createPredMap(const Graph& graph) { … … 168 168 /// 169 169 /// This function instantiates a \ref DistMap. 170 /// \param Gis the graph, to which we would like to define the170 /// \param graph is the graph, to which we would like to define the 171 171 /// \ref DistMap 172 172 static DistMap *createDistMap(const _Graph& graph) { -
lemon/preflow.h
r1898 r1953 153 153 ///\param _cap The capacity of the edges. 154 154 ///\param _f The flow of the edges. 155 ///\param tol Tolerance class. 155 156 ///Except the graph, all of these parameters can be reset by 156 157 ///calling \ref source, \ref target, \ref capacityMap and \ref -
lemon/prim.h
r1912 r1953 57 57 58 58 ///This function instantiates a \ref HeapCrossRef. 59 /// \param Gis the graph, to which we would like to define the59 /// \param _graph is the graph, to which we would like to define the 60 60 /// HeapCrossRef. 61 61 static HeapCrossRef *createHeapCrossRef(const GR &_graph){ … … 87 87 88 88 ///This function instantiates a \ref PredMap. 89 ///\param Gis the graph, to which we would like to define the PredMap.89 ///\param _graph is the graph, to which we would like to define the PredMap. 90 90 static PredMap *createPredMap(const GR &_graph){ 91 91 return new PredMap(_graph); … … 102 102 103 103 ///This function instantiates a \ref TreeMap. 104 ///\param g is the graph, to which 104 /// 105 ///The first parameter is the graph, to which 105 106 ///we would like to define the \ref TreeMap 106 107 static TreeMap *createTreeMap(const GR &){ … … 117 118 118 119 ///This function instantiates a \ref ProcessedMap. 119 ///\param gis the graph, to which120 ///\param _graph is the graph, to which 120 121 ///we would like to define the \ref ProcessedMap 121 122 #ifdef DOXYGEN … … 704 705 ///Sets the TreeMap of the edges of the minimum spanning tree. 705 706 ///The map values belonging to the edges of the minimum 706 ///spanning tree are set to \ paramtree_edge_value or \c true by default,707 ///spanning tree are set to \c tree_edge_value or \c true by default, 707 708 ///the other map values remain untouched. 708 709 /// … … 722 723 ///Sets the TreeMap of the edges of the minimum spanning tree. 723 724 ///The map values belonging to the edges of the minimum 724 ///spanning tree are set to \ paramtree_edge_value or \c true by default while725 ///spanning tree are set to \c tree_edge_value or \c true by default while 725 726 ///the edge values not belonging to the minimum spanning tree are set to 726 ///\ paramtree_default_value or \c false by default.727 ///\c tree_default_value or \c false by default. 727 728 /// 728 729 ///\pre \ref run() or \ref start() must be called before using this function. -
lemon/time_measure.h
r1894 r1953 273 273 ///Constructor. 274 274 275 ///\param _runningindicates whether or not the timer starts immediately.275 ///\param run indicates whether or not the timer starts immediately. 276 276 /// 277 277 Timer(bool run=true) :_running(run) {_reset();} -
lemon/tolerance.h
r1897 r1953 40 40 /// 41 41 ///This is an abstract class, it should be specialized for all numerical 42 ///data types. These specialized classes like \ref Tolerance <double>42 ///data types. These specialized classes like \ref Tolerance\<double\> 43 43 ///may offer additional tuning parameters. 44 44 ///
Note: See TracChangeset
for help on using the changeset viewer.