COIN-OR::LEMON - Graph Library

Changeset 1765:f15b3c09481c in lemon-0.x


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

Location:
lemon
Files:
6 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
  • lemon/bfs.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()
     
    611610    ///If \c t is a source itself or unreachable, then it does not
    612611    ///alter \c p.
    613     ///\todo Is it the right way to handle unreachable nodes?
    614612    ///\return Returns \c true if a path to \c t was actually copied to \c p,
    615613    ///\c false otherwise.
     
    648646    ///\pre Either \ref run() or \ref start() must be called before using
    649647    ///this function.
    650     ///\todo predEdge could be a better name.
    651648    Edge predEdge(Node v) const { return (*_pred)[v];}
    652649
  • 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   
  • 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
  • lemon/floyd_warshall.h

    r1763 r1765  
    2222/// \brief FloydWarshall algorithm.
    2323///
    24 /// \todo getPath() should be implemented! (also for BFS and DFS)
    2524
    2625#include <lemon/list_graph.h>
     
    480479    /// If it \c t is a source itself or unreachable, then it does not
    481480    /// alter \c p.
    482     /// \todo Is it the right way to handle unreachable nodes?
    483481    /// \return Returns \c true if a path to \c t was actually copied to \c p,
    484482    /// \c false otherwise.
     
    518516    /// shortest path tree used in \ref predNode().
    519517    /// \pre \ref run() must be called before using this function.
    520     /// \todo predEdge could be a better name.
    521518    Edge predEdge(Node root, Node node) const {
    522519      return (*_pred)(root, node);
  • lemon/johnson.h

    r1763 r1765  
    626626    /// If it \c t is a source itself or unreachable, then it does not
    627627    /// alter \c p.
    628     /// \todo Is it the right way to handle unreachable nodes?
    629628    /// \return Returns \c true if a path to \c t was actually copied to \c p,
    630629    /// \c false otherwise.
     
    664663    /// shortest path tree used in \ref predNode().
    665664    /// \pre \ref run() must be called before using this function.
    666     /// \todo predEdge could be a better name.
    667665    Edge predEdge(Node root, Node node) const {
    668666      return (*_pred)(root, node);
Note: See TracChangeset for help on using the changeset viewer.