COIN-OR::LEMON - Graph Library

Changeset 1765:f15b3c09481c in lemon-0.x for lemon/floyd_warshall.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/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);
Note: See TracChangeset for help on using the changeset viewer.