source: lemon-0.x/src/work/deba/main.cpp @ 656:9971eb8bfbe8

#include <iostream>
#include <cstdlib>
#include "test_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::NodeMapFactory::Map<int> map(g, g.node_maps);
  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;
  }
  return 0;
}