COIN-OR::LEMON - Graph Library

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

    r1763 r1765  
    193193    ///Creates the maps if necessary.
    194194   
    195     ///\todo Error if \c G are \c NULL.
    196195    ///\todo Better memory allocation (instead of new).
    197196    void create_maps()
     
    509508    ///Returns \c false if there are nodes
    510509    ///to be processed in the queue
    511     ///
    512     ///\todo This should be called emptyStack() or some "neutral" name.
    513510    bool emptyQueue() { return _stack_head<0; }
    514511    ///Returns the number of the nodes to be processed.
    515512   
    516513    ///Returns the number of the nodes to be processed in the queue.
    517     ///
    518     ///\todo This should be called stackSize() or some "neutral" name.
    519514    int queueSize() { return _stack_head+1; }
    520515   
     
    632627    ///If \c t is a source itself or unreachable, then it does not
    633628    ///alter \c p.
    634     ///\todo Is this the right way to handle unreachable nodes?
    635629    ///
    636630    ///\return Returns \c true if a path to \c t was actually copied to \c p,
     
    670664    ///\pre Either \ref run() or \ref start() must be called before using
    671665    ///this function.
    672     ///\todo predEdge could be a better name.
    673666    Edge predEdge(Node v) const { return (*_pred)[v];}
    674667
     
    13821375    /// Returns \c false if there are nodes
    13831376    /// to be processed in the queue
    1384     ///
    1385     /// \todo This should be called emptyStack() or some "neutral" name.
    13861377    bool emptyQueue() { return _stack_head < 0; }
    13871378
     
    13891380    ///
    13901381    /// Returns the number of the nodes to be processed in the queue.
    1391     ///
    1392     ///\todo This should be called stackSize() or some "neutral" name.
    13931382    int queueSize() { return _stack_head + 1; }
    13941383   
Note: See TracChangeset for help on using the changeset viewer.