Hi All, I have a few collections of edges that connect vertices of different types based on different relationships. In EdgeCollection, I have next_src/next_dest, how do I model DFS and BFS efficiently without having to maintain different iterator pointers? For DFS, I want to go all the way on the connected vertex until next_src/next_dest is false before traversing up to find next_dest/next_src on the original iterator of the vertex I started. Need to also take care of circular references.
Any pointers highly appreciated. Thanks, Muni
