COIN-OR::LEMON - Graph Library

Changeset 1765:f15b3c09481c in lemon-0.x for lemon/belmann_ford.h


Ignore:
Timestamp:
11/04/05 16:00:19 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2297
Message:

Removing todos

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/belmann_ford.h

    r1763 r1765  
    2222/// \brief BelmannFord algorithm.
    2323///
    24 /// \todo getPath() should be implemented! (also for BFS and DFS)
    2524
    2625#include <lemon/list_graph.h>
     
    495494    /// If it \c t is a source itself or unreachable, then it does not
    496495    /// alter \c p.
    497     /// \todo Is it the right way to handle unreachable nodes?
     496    ///
    498497    /// \return Returns \c true if a path to \c t was actually copied to \c p,
    499498    /// \c false otherwise.
     
    529528    /// \pre \ref run() must be called before using
    530529    /// this function.
    531     /// \todo predEdge could be a better name.
    532530    Edge predEdge(Node v) const { return (*_pred)[v]; }
    533531
Note: See TracChangeset for help on using the changeset viewer.