# Changeset 2281:55b15666560f in lemon-0.x

Ignore:
Timestamp:
10/31/06 10:32:44 (13 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3045
Message:

tutorial update
algorithms, and graph visualisation

Files:
3 edited

Unmodified
Removed
• ## demo/kruskal_demo.cc

 r1956 int k=0; std::cout << "The edges of the tree:" ; for(EdgeIt i(g); i!=INVALID; ++i){ for(EdgeIt i(g); i!=INVALID; ++i) if (tree_map[i]) { std::cout << g.id(i) <<";"; ++k; } } std::cout << std::endl; std::cout << "The size of the tree is: "<< k << std::endl;
• ## doc/algorithms.dox

 r2216 First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering will be done through it. \skip SerializingWriteMap \skip MyOrdererMap \until }; The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing we need to do is insert the key - that is the node who's processing just finished - into the beginning of the list. of the list.
Although we implemented this needed helper class ourselves it was not necessary. The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly what we needed. To be correct it's more general - and it's all in \c LEMON. But we wanted to show you, how easy is to add additional functionality. First we declare the needed data structures: the graph and a map to store the nodes' label. The program is to be found in the \ref demo directory: \ref topological_ordering.cc More algorithms are described in the \ref algorithms2 "second part". */ }
• ## doc/tutorial.dox

 r2216
• \ref algo_bfs_dfs
• Dijkstra
• Kruskal
• \ref algo_dijkstra
• \ref algo_kruskal
• \ref maps2
• Special Purpose Maps
• Show a graph
• \ref show_a_graph
• Miscellaneous Tool
Note: See TracChangeset for help on using the changeset viewer.