COIN-OR::LEMON - Graph Library

Changeset 1765:f15b3c09481c in lemon-0.x for lemon/dijkstra.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/dijkstra.h

    r1763 r1765  
    2222///\brief Dijkstra algorithm.
    2323///
    24 ///\todo getPath() should be implemented! (also for BFS and DFS)
    2524///\todo dijkstraZero() solution should be revised.
    2625
     
    247246    ///Creates the maps if necessary.
    248247   
    249     ///\todo Error if \c G or are \c NULL. What about \c length?
    250248    ///\todo Better memory allocation (instead of new).
    251249    void create_maps()
     
    724722    ///If it \c t is a source itself or unreachable, then it does not
    725723    ///alter \c p.
    726     ///\todo Is it the right way to handle unreachable nodes?
    727724    ///\return Returns \c true if a path to \c t was actually copied to \c p,
    728725    ///\c false otherwise.
     
    759756    ///\ref predNode().  \pre \ref run() must be called before using
    760757    ///this function.
    761     ///\todo predEdge could be a better name.
    762758    Edge predEdge(Node v) const { return (*_pred)[v]; }
    763759
Note: See TracChangeset for help on using the changeset viewer.