source: lemon-0.x/src/work/deba/main.cpp @ 702:4207f82a1778

#include <iostream>
#include <cstdlib>
#include "list_graph.h"

using namespace std;
using namespace hugo;


int main() {
  ListGraph g;
  for (int i = 0; i < 10; ++i) {
    ListGraph::Node node = g.addNode();
  }
  ListGraph::NodeMap<int> map(g, 10);
  for (int i = 0; i < 10; ++i) {
    ListGraph::Node node = g.addNode();
    map[node] = rand()%100;
  }
  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    cout << map[it] << endl;
  }
  ListGraph::NodeMap<int>::iterator pit;
  for (pit = map.begin(); pit != map.end(); ++pit) {
    cout << g.id(pit->first) << ' ' << pit->second << endl;
  }
  /*
  ListGraph::NodeMap<double> ot_map = map;
  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    ot_map[it] *= 2.1;
    cout << ot_map[it] << endl;
  }
  ot_map = map;
  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    ot_map[it] *= 3.1;
    cout << ot_map[it] << endl;
    }*/
  return 0;
}