1.1 --- a/src/work/deba/main.cpp	Wed Jul 14 10:05:31 2004 +0000
     1.2 +++ b/src/work/deba/main.cpp	Wed Jul 14 10:06:27 2004 +0000
     1.3 @@ -11,7 +11,7 @@
     1.4    for (int i = 0; i < 10; ++i) {
     1.5      ListGraph::Node node = g.addNode();
     1.6    }
     1.7 -  ListGraph::NodeMap<int> map(g);
     1.8 +  ListGraph::NodeMap<int> map(g, 10);
     1.9    for (int i = 0; i < 10; ++i) {
    1.10      ListGraph::Node node = g.addNode();
    1.11      map[node] = rand()%100;
    1.12 @@ -19,6 +19,20 @@
    1.13    for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    1.14      cout << map[it] << endl;
    1.15    }
    1.16 +  ListGraph::NodeMap<int>::iterator pit;
    1.17 +  for (pit = map.begin(); pit != map.end(); ++pit) {
    1.18 +    cout << g.id(pit->first) << ' ' << pit->second << endl;
    1.19 +  }
    1.20 +  ListGraph::NodeMap<double> ot_map = map;
    1.21 +  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    1.22 +    ot_map[it] *= 2.1;
    1.23 +    cout << ot_map[it] << endl;
    1.24 +  }
    1.25 +  ot_map = map;
    1.26 +  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    1.27 +    ot_map[it] *= 3.1;
    1.28 +    cout << ot_map[it] << endl;
    1.29 +  }
    1.30    return 0;
    1.31  }
    1.32