Bug fix in ConEdgeIt implementation

[Peter Kovacs]

The attached patch contains a bug fix for ConEdgeIt.

Since the erroneous code is in the 1.0 branch, too, I made the patch on the top of [62f9787c516c]. However the only example I found to indicate the error uses adaptors.

Here it is:

#include<lemon/list_graph.h>
#include<lemon/adaptors.h>
#include<test/graph_test.h>

using namespace lemon;

int main() {
  ListGraph graph;
  ListGraph::Node n1 = graph.addNode();
  ListGraph::Node n2 = graph.addNode();
  ListGraph::Node n3 = graph.addNode();
  graph.addEdge(n1,n2);
  graph.addEdge(n1,n3);
  graph.addEdge(n2,n3);
  
  checkGraphConEdgeList(undirector(graph), 6);

  return 0;
}

If you try to compile and run this code using [919878a41a60], it will fall into an infinite loop!

[Alpar Juttner]

[b0f74ca2e3ac] has been merged to both 1.0 and the main branch.