Changeset 1765:f15b3c09481c in lemon-0.x for lemon
- Timestamp:
- 11/04/05 16:00:19 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2297
- Location:
- lemon
- Files:
-
- 6 edited
-
belmann_ford.h (modified) (3 diffs)
-
bfs.h (modified) (3 diffs)
-
dfs.h (modified) (6 diffs)
-
dijkstra.h (modified) (4 diffs)
-
floyd_warshall.h (modified) (3 diffs)
-
johnson.h (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/belmann_ford.h
r1763 r1765 22 22 /// \brief BelmannFord algorithm. 23 23 /// 24 /// \todo getPath() should be implemented! (also for BFS and DFS)25 24 26 25 #include <lemon/list_graph.h> … … 495 494 /// If it \c t is a source itself or unreachable, then it does not 496 495 /// alter \c p. 497 /// \todo Is it the right way to handle unreachable nodes?496 /// 498 497 /// \return Returns \c true if a path to \c t was actually copied to \c p, 499 498 /// \c false otherwise. … … 529 528 /// \pre \ref run() must be called before using 530 529 /// this function. 531 /// \todo predEdge could be a better name.532 530 Edge predEdge(Node v) const { return (*_pred)[v]; } 533 531 -
lemon/bfs.h
r1763 r1765 193 193 ///Creates the maps if necessary. 194 194 195 ///\todo Error if \c G are \c NULL.196 195 ///\todo Better memory allocation (instead of new). 197 196 void create_maps() … … 611 610 ///If \c t is a source itself or unreachable, then it does not 612 611 ///alter \c p. 613 ///\todo Is it the right way to handle unreachable nodes?614 612 ///\return Returns \c true if a path to \c t was actually copied to \c p, 615 613 ///\c false otherwise. … … 648 646 ///\pre Either \ref run() or \ref start() must be called before using 649 647 ///this function. 650 ///\todo predEdge could be a better name.651 648 Edge predEdge(Node v) const { return (*_pred)[v];} 652 649 -
lemon/dfs.h
r1763 r1765 193 193 ///Creates the maps if necessary. 194 194 195 ///\todo Error if \c G are \c NULL.196 195 ///\todo Better memory allocation (instead of new). 197 196 void create_maps() … … 509 508 ///Returns \c false if there are nodes 510 509 ///to be processed in the queue 511 ///512 ///\todo This should be called emptyStack() or some "neutral" name.513 510 bool emptyQueue() { return _stack_head<0; } 514 511 ///Returns the number of the nodes to be processed. 515 512 516 513 ///Returns the number of the nodes to be processed in the queue. 517 ///518 ///\todo This should be called stackSize() or some "neutral" name.519 514 int queueSize() { return _stack_head+1; } 520 515 … … 632 627 ///If \c t is a source itself or unreachable, then it does not 633 628 ///alter \c p. 634 ///\todo Is this the right way to handle unreachable nodes?635 629 /// 636 630 ///\return Returns \c true if a path to \c t was actually copied to \c p, … … 670 664 ///\pre Either \ref run() or \ref start() must be called before using 671 665 ///this function. 672 ///\todo predEdge could be a better name.673 666 Edge predEdge(Node v) const { return (*_pred)[v];} 674 667 … … 1382 1375 /// Returns \c false if there are nodes 1383 1376 /// to be processed in the queue 1384 ///1385 /// \todo This should be called emptyStack() or some "neutral" name.1386 1377 bool emptyQueue() { return _stack_head < 0; } 1387 1378 … … 1389 1380 /// 1390 1381 /// Returns the number of the nodes to be processed in the queue. 1391 ///1392 ///\todo This should be called stackSize() or some "neutral" name.1393 1382 int queueSize() { return _stack_head + 1; } 1394 1383 -
lemon/dijkstra.h
r1763 r1765 22 22 ///\brief Dijkstra algorithm. 23 23 /// 24 ///\todo getPath() should be implemented! (also for BFS and DFS)25 24 ///\todo dijkstraZero() solution should be revised. 26 25 … … 247 246 ///Creates the maps if necessary. 248 247 249 ///\todo Error if \c G or are \c NULL. What about \c length?250 248 ///\todo Better memory allocation (instead of new). 251 249 void create_maps() … … 724 722 ///If it \c t is a source itself or unreachable, then it does not 725 723 ///alter \c p. 726 ///\todo Is it the right way to handle unreachable nodes?727 724 ///\return Returns \c true if a path to \c t was actually copied to \c p, 728 725 ///\c false otherwise. … … 759 756 ///\ref predNode(). \pre \ref run() must be called before using 760 757 ///this function. 761 ///\todo predEdge could be a better name.762 758 Edge predEdge(Node v) const { return (*_pred)[v]; } 763 759 -
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); -
lemon/johnson.h
r1763 r1765 626 626 /// If it \c t is a source itself or unreachable, then it does not 627 627 /// alter \c p. 628 /// \todo Is it the right way to handle unreachable nodes?629 628 /// \return Returns \c true if a path to \c t was actually copied to \c p, 630 629 /// \c false otherwise. … … 664 663 /// shortest path tree used in \ref predNode(). 665 664 /// \pre \ref run() must be called before using this function. 666 /// \todo predEdge could be a better name.667 665 Edge predEdge(Node root, Node node) const { 668 666 return (*_pred)(root, node);
Note: See TracChangeset
for help on using the changeset viewer.
