Changeset 1715:e71778873dd0 in lemon-0.x
- Timestamp:
- 10/07/05 13:05:08 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2242
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/dijkstra_demo.cc
r1641 r1715 17 17 ///\ingroup demos 18 18 ///\file 19 ///\brief Demonstrating LEMON implementation of theDijkstra algorithm19 ///\brief Demonstrating the usage of LEMON's Dijkstra algorithm 20 20 /// 21 21 /// Dijkstra's algorithm computes shortest paths between two nodes in -
doc/dirs.dox
r1416 r1715 1 /** 2 \dir demo 3 \brief A collection of demo application. 4 5 This directory contains several simple demo application, mainly 6 for educational purposes. 7 */ 8 9 /** 10 \dir doc 11 \brief Auxiliary (and the whole generated) documentation. 12 Auxiliary (and the whole generated) documentation. 13 */ 14 15 /** 16 \dir test 17 \brief Test programs. 18 19 This directory contains several test programs that check the consistency 20 of the code. 21 */ 22 23 24 25 1 26 /** 2 27 \dir lemon -
doc/graph_orientation.dox
r1684 r1715 102 102 \until def 103 103 104 We also store in a bool map which edges are reverted. Actually this is only104 We also store in a bool map indicating which edges are reverted. Actually this is only 105 105 used to draw these edges with different color in the output picture. The 106 106 algorithm will update this map called \c rev, but will not use it otherwise.
Note: See TracChangeset
for help on using the changeset viewer.