deba@378: #include <iostream>
deba@595: #include <cstdlib>
deba@378: #include "test_graph.h"
deba@378: 
deba@378: using namespace std;
deba@378: using namespace hugo;
deba@378: 
deba@378: 
deba@378: int main() {
deba@378: 	ListGraph g;
deba@595: 	for (int i = 0; i < 3; ++i) {
deba@595: 		ListGraph::Node node = g.addNode();
deba@595: 	}
deba@595: 	ListGraph::NodeMapFactory::Map<int> map(g, g.node_maps);
deba@595: 	for (int i = 0; i < 10; ++i) {
deba@595: 		ListGraph::Node node = g.addNode();
deba@595: 		map[node] = rand()%100;
deba@595: 	}
deba@595: 	for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
deba@595: 		cout << map[it] << endl;
deba@595: 	}
deba@378: 	return 0;
deba@378: }
deba@378: