Re: [Boost-users] bgl: Walking through two adjacency lists in parallel

--- Lars Kunert wrote:

Hi!

Hello, there.

I am using a graph with setS as EdgeList template-parameter.

I currently try to implement to get the number of neighbors which two vertices have in common. I tried to solve this problem by walking thought both out_edge_iterator - ranges in parallel.

tie(i, i_end) = out_edges(vertex_i, graph); tie(j, j_end) = out_edges(vertex_j, graph);

[snip] I'm assuming you're using adjacency_list with vecS as your VertexList template parameter. Try using adjacent_vertices instead of out_edges. Cromwell Enage _______________________________ Do you Yahoo!? Declare Yourself - Register online to vote today! http://vote.yahoo.com