vector<vector<edge_t> > enumerate_edges(graph_t const &graph, int count) { vector<edge_t> edges; // now, consider edges for(graph_t::vertex_iterator i(graph.begin_verts());i!=graph.end_verts();++i) { unsigned int v = *i; for(graph_t::edge_iterator j(graph.begin_edges(v));j!=graph.end_edges(v);++j) { unsigned int w = j->first; // now add this edge(s) to nauty graph if(v <= w) { edges.push_back(edge_t(v,w)); } } } return enumerate_edges_helper(edges,count); }