Why does the Eulerian Tour Algorithm actually work?
Difference between en1 and en2, changed 47 character(s)
I actually understood the method done in Euler Tour algorithm but don't understand why it works?↵
Here is the pseudo.↵
↵
dfs (v):↵
        color[v] = gray↵
        for u in adj[v]:↵
                erase the edge v-u and dfs(u)↵
        color[v] = black↵
↵
↵
↵
        dfs (v):↵
               color[v] = gray↵
               for u in adj[v]:↵
                   erase the edge v-u and dfs(u)↵
                color[v] = black↵
                push v at the end of e

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English desik 2017-03-23 13:07:46 66
en2 English desik 2017-03-23 12:56:23 47
en1 English desik 2017-03-23 12:55:24 336 Initial revision (published)