Changeset 1765:f15b3c09481c in lemon-0.x for lemon/floyd_warshall.h
- Timestamp:
- 11/04/05 16:00:19 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2297
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/floyd_warshall.h
r1763 r1765 22 22 /// \brief FloydWarshall algorithm. 23 23 /// 24 /// \todo getPath() should be implemented! (also for BFS and DFS)25 24 26 25 #include <lemon/list_graph.h> … … 480 479 /// If it \c t is a source itself or unreachable, then it does not 481 480 /// alter \c p. 482 /// \todo Is it the right way to handle unreachable nodes?483 481 /// \return Returns \c true if a path to \c t was actually copied to \c p, 484 482 /// \c false otherwise. … … 518 516 /// shortest path tree used in \ref predNode(). 519 517 /// \pre \ref run() must be called before using this function. 520 /// \todo predEdge could be a better name.521 518 Edge predEdge(Node root, Node node) const { 522 519 return (*_pred)(root, node);
Note: See TracChangeset
for help on using the changeset viewer.