Some more doxygen command killed.
2 #include <lemon/list_graph.h>
6 typedef lemon::ListGraph Graph;
7 typedef Graph::EdgeIt EdgeIt;
8 typedef Graph::Edge Edge;
9 typedef Graph::NodeIt NodeIt;
10 typedef Graph::Node Node;
11 typedef Graph::EdgeMap<int> LengthMap;
23 Edge s_v2=g.addEdge(s, v2);
24 Edge s_v3=g.addEdge(s, v3);
25 Edge v2_v4=g.addEdge(v2, v4);
26 Edge v2_v5=g.addEdge(v2, v5);
27 Edge v3_v5=g.addEdge(v3, v5);
28 Edge v4_t=g.addEdge(v4, t);
29 Edge v5_t=g.addEdge(v5, t);
41 std::cout << "Hello World!" << std::endl;
42 std::cout << std::endl;
43 std::cout << "This is library LEMON here! We have a graph!" << std::endl;
44 std::cout << std::endl;
46 std::cout << "Nodes:";
47 for (NodeIt i(g); i!=INVALID; ++i)
48 std::cout << " " << g.id(i);
49 std::cout << std::endl;
51 std::cout << "Edges:";
52 for (EdgeIt i(g); i!=INVALID; ++i)
53 std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")";
54 std::cout << std::endl;
55 std::cout << std::endl;
57 std::cout << "There is a map on the edges (length)!" << std::endl;
58 std::cout << std::endl;
59 for (EdgeIt i(g); i!=INVALID; ++i)
60 std::cout << "length(" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")="<<length[i]<<std::endl;
62 std::cout << std::endl;