COIN-OR::LEMON - Graph Library

Changeset 1858:a5b6d941ed52 in lemon-0.x


Ignore:
Timestamp:
12/14/05 19:07:28 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2430
Message:

Bug fix in def pred map

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/belmann_ford.h

    r1857 r1858  
    1818#define LEMON_BELMANN_FORD_H
    1919
    20 ///\ingroup flowalgs
     20/// \ingroup flowalgs
    2121/// \file
    2222/// \brief BelmannFord algorithm.
     
    116116    ///
    117117    /// 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.
    120119    static PredMap *createPredMap(const _Graph& graph) {
    121120      return new PredMap(graph);
     
    133132    ///
    134133    /// This function instantiates a \ref DistMap.
    135     /// \param G is the graph, to which we would like to define the
     134    /// \param graph is the graph, to which we would like to define the
    136135    /// \ref DistMap
    137136    static DistMap *createDistMap(const _Graph& graph) {
     
    270269    ///
    271270    template <class T>
    272     struct DefPredMap {
     271    struct DefPredMap
     272      : public BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > {
    273273      typedef BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > Create;
    274274    };
     
    423423    /// distances strictly for all at most k + 1 length paths. With k
    424424    /// 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.
    426426    bool processNextRound() {
    427427      for (int i = 0; i < (int)_process.size(); ++i) {
     
    459459    /// at most k length minimal paths, this is why it is
    460460    /// called just weak round.
    461     ///\todo what is the return value?
     461    /// \return %True when the algorithm have not found more shorter paths.
    462462    bool processNextWeakRound() {
    463463      for (int i = 0; i < (int)_process.size(); ++i) {
     
    846846    ///
    847847    /// Runs BelmannFord algorithm from the given node.
    848     /// \param s is the given source.
     848    /// \param source is the given source.
    849849    void run(Node source) {
    850850      Base::_source = source;
     
    911911    ///
    912912    /// Sets the source node, from which the BelmannFord algorithm runs.
    913     /// \param s is the source node.
     913    /// \param source is the source node.
    914914    BelmannFordWizard<_Traits>& source(Node source) {
    915915      Base::_source = source;
Note: See TracChangeset for help on using the changeset viewer.