COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/deba/main.cpp @ 1133:9fd485470fee

Last change on this file since 1133:9fd485470fee was 922:e816fac59f6d, checked in by Mihaly Barasz, 20 years ago

hugo -> lemon renaming leftovers

File size: 1.0 KB
Line 
1// -*- c++ -*-
2#include <iostream>
3#include <cstdlib>
4#include "list_graph.h"
5
6using namespace std;
7using namespace lemon;
8
9
10
11int main() {
12  ListGraph g;
13  for (int i = 0; i < 10; ++i) {
14    ListGraph::Node node = g.addNode();
15  }
16  ListGraph::NodeMap<int> map(g, 10);
17  for (int i = 0; i < 10; ++i) {
18    ListGraph::Node node = g.addNode();
19    map[node] = rand()%100;
20  }
21  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
22    cout << map[it] << endl;
23  }
24  ListGraph::NodeMap<int>::iterator pit;
25  for (pit = map.begin(); pit != map.end(); ++pit) {
26    cout << g.id(pit->first) << ' ' << pit->second << endl;
27    (*pit).second = g.id(pit->first);
28    cout << g.id((*pit).first) << ' ' << (*pit).second << endl;
29  } 
30  const ListGraph::NodeMap<int> const_map = map;
31  ListGraph::NodeMap<int>::const_iterator cit;
32  for (cit = const_map.begin(); cit != const_map.end(); ++cit) {
33    cerr << g.id(cit->first) << ' ' << cit->second << endl;
34    cerr << g.id((*cit).first) << ' ' << (*cit).second << endl;
35  } 
36  return 0;
37}
38
Note: See TracBrowser for help on using the repository browser.