For finding Eulerian Circuit, storage of state of edge being visited or not

50 views Asked by At

There is a graph of vertex set V, such that |V| >= 100000 and edge set E, such that |E|<= 200000. Am am trying to traversing Eulerian Circuit in the graph. For that, I need to store whether a particular edge is visited or not? I usually use 2D array for that, but due to big size of |V| I can't use arrays. What should I use properly to store the state of the edge being visited or not, efficiently?

0

There are 0 answers