| author | athos |
| Tue, 01 Jun 2004 11:00:24 +0000 | |
| changeset 671 | 708df4dc6ab6 |
| parent 595 | e10b5e9419ef |
| child 674 | 7733d18de0e8 |
| permissions | -rw-r--r-- |
1 #include <iostream>
2 #include <cstdlib>
3 #include "test_graph.h"
5 using namespace std;
6 using namespace hugo;
9 int main() {
10 ListGraph g;
11 for (int i = 0; i < 10; ++i) {
12 ListGraph::Node node = g.addNode();
13 }
14 ListGraph::NodeMapFactory::Map<int> map(g, g.node_maps);
15 for (int i = 0; i < 10; ++i) {
16 ListGraph::Node node = g.addNode();
17 map[node] = rand()%100;
18 }
19 for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
20 cout << map[it] << endl;
21 }
22 return 0;
23 }