Changeset 2281:55b15666560f in lemon-0.x
- Timestamp:
- 10/31/06 10:32:44 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3045
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
demo/kruskal_demo.cc
r1956 r2281 107 107 int k=0; 108 108 std::cout << "The edges of the tree:" ; 109 for(EdgeIt i(g); i!=INVALID; ++i){ 110 109 for(EdgeIt i(g); i!=INVALID; ++i) 111 110 if (tree_map[i]) { 112 111 std::cout << g.id(i) <<";"; 113 112 ++k; 114 113 } 115 } 114 116 115 std::cout << std::endl; 117 116 std::cout << "The size of the tree is: "<< k << std::endl; -
doc/algorithms.dox
r2216 r2281 95 95 First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering 96 96 will be done through it. 97 \skip SerializingWriteMap97 \skip MyOrdererMap 98 98 \until }; 99 99 The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing 100 100 we need to do is insert the key - that is the node who's processing just finished - into the beginning 101 of the list. 101 of the list.<br> 102 Although we implemented this needed helper class ourselves it was not necessary. 103 The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly 104 what we needed. To be correct it's more general - and it's all in \c LEMON. But 105 we wanted to show you, how easy is to add additional functionality. 102 106 103 107 First we declare the needed data structures: the graph and a map to store the nodes' label. … … 127 131 128 132 The program is to be found in the \ref demo directory: \ref topological_ordering.cc 133 134 More algorithms are described in the \ref algorithms2 "second part". 129 135 */ 130 136 } -
doc/tutorial.dox
r2216 r2281 24 24 <UL> 25 25 <LI>\ref algo_bfs_dfs 26 <LI> Dijkstra27 <LI> Kruskal26 <LI>\ref algo_dijkstra 27 <LI>\ref algo_kruskal 28 28 </UL> 29 29 <LI>\ref maps2 … … 33 33 <LI>Special Purpose Maps 34 34 </UL> 35 <LI> Show agraph35 <LI>\ref show_a_graph 36 36 <LI>Miscellaneous Tool 37 37 <UL>
Note: See TracChangeset
for help on using the changeset viewer.