Find edge uses wrong iterator logic

[ehein6]

This iterator logic looks broken to me. Shouldn't the iterator eit be compared against the end of the list instead of the beginning?

graphBIG/openG/openG_graph.h

Lines 249 to 264 in fc1ef15

	edge_iterator find_in_edge(uint64_t vid, edge_iterator eit)
	{
	for (;eit!=in_edges.begin();eit++)
	{
	if (eit->target()==vid)
	return eit;
	}
	}
	edge_iterator find_out_edge(uint64_t vid, edge_iterator eit)
	{
	for (;eit!=out_edges.begin();eit++)
	{
	if (eit->target()==vid)
	return eit;
	}
	}

[nailifeng]

Thanks a lot for pointing it out. Yes, it is an error. I'll fix it right away. Fortunately, these two APIs were never actually used in the workloads, so they didn't break any benchmarks.