Changeset 1858:a5b6d941ed52 in lemon0.x for lemon
 Timestamp:
 12/14/05 19:07:28 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2430
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/belmann_ford.h
r1857 r1858 18 18 #define LEMON_BELMANN_FORD_H 19 19 20 /// \ingroup flowalgs20 /// \ingroup flowalgs 21 21 /// \file 22 22 /// \brief BelmannFord algorithm. … … 116 116 /// 117 117 /// This function instantiates a \ref PredMap. 118 /// \param G is the graph, to which we would like to define the PredMap. 119 /// \todo The graph alone may be insufficient for the initialization 118 /// \param graph is the graph, to which we would like to define the PredMap. 120 119 static PredMap *createPredMap(const _Graph& graph) { 121 120 return new PredMap(graph); … … 133 132 /// 134 133 /// This function instantiates a \ref DistMap. 135 /// \param Gis the graph, to which we would like to define the134 /// \param graph is the graph, to which we would like to define the 136 135 /// \ref DistMap 137 136 static DistMap *createDistMap(const _Graph& graph) { … … 270 269 /// 271 270 template <class T> 272 struct DefPredMap { 271 struct DefPredMap 272 : public BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > { 273 273 typedef BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > Create; 274 274 }; … … 423 423 /// distances strictly for all at most k + 1 length paths. With k 424 424 /// iteration this function calculates the at most k length paths. 425 /// \todo what is the return value?425 /// \return %True when the algorithm have not found more shorter paths. 426 426 bool processNextRound() { 427 427 for (int i = 0; i < (int)_process.size(); ++i) { … … 459 459 /// at most k length minimal paths, this is why it is 460 460 /// called just weak round. 461 /// \todo what is the return value?461 /// \return %True when the algorithm have not found more shorter paths. 462 462 bool processNextWeakRound() { 463 463 for (int i = 0; i < (int)_process.size(); ++i) { … … 846 846 /// 847 847 /// Runs BelmannFord algorithm from the given node. 848 /// \param s is the given source.848 /// \param source is the given source. 849 849 void run(Node source) { 850 850 Base::_source = source; … … 911 911 /// 912 912 /// Sets the source node, from which the BelmannFord algorithm runs. 913 /// \param s is the source node.913 /// \param source is the source node. 914 914 BelmannFordWizard<_Traits>& source(Node source) { 915 915 Base::_source = source;
Note: See TracChangeset
for help on using the changeset viewer.