Changeset 1200:ae69f556b429 in lemon-0.x
- Timestamp:
- 03/06/05 22:13:24 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1612
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/graphs.dox
r1168 r1200 45 45 are shared by the edge pairs. 46 46 \li \ref lemon::FullGraph "FullGraph" 47 implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot 47 implements a complete graph. It is a 48 \ref lemon::concept::StaticGraph "StaticGraph", so you cannot 48 49 change the number of nodes once it is constructed. It is extremely memory 49 50 efficient: it uses constant amount of memory independently from the number of -
src/test/test_tools.h
r1164 r1200 27 27 //! \ingroup misc 28 28 //! \file 29 //! \brief Some utilit yto write test programs.29 //! \brief Some utilities to write test programs. 30 30 31 31 … … 92 92 } 93 93 94 /// \brief Adds to the graph the reverse pair of all edge .94 /// \brief Adds to the graph the reverse pair of all edges. 95 95 /// 96 /// Adds to the graph the reverse pair of all edge .96 /// Adds to the graph the reverse pair of all edges. 97 97 /// 98 98 template<class Graph> void bidirGraph(Graph &G)
Note: See TracChangeset
for help on using the changeset viewer.