Tarjan s algorithm(brietly) //color[u=0: unvisited; 1: visited and in Stack, 2 visited and not in stack try all vertex u, if color[u]=0, DFS(u DFS( · Push u into stack, color=1,pe山ow=++me all neighbor v of u if color[v=0, dFS(v), lowu= minow(u, low/y else if color[v] =1, low(u]=inflow/],pre[vlh if low(u==pre[u Pop v from stack, color[v]=2, until v=u:Tarjan’s algorithm (briefly) • //color[u] = 0: unvisited; 1: visited and in Stack, 2: visited and not in Stack • try all vertex u, if color[u] = 0, DFS(u) • DFS(u): • Push u into stack, color[u] = 1, pre[u], low[u] = ++time • try all neighbor v of u • if color[v] = 0, DFS(v), low[u] = min{low[u],low[v]} • else if color[v] = 1, low[u] = min{low[u],pre[v]} • if low[u]==pre[u] • Pop v from stack, color[v] = 2, until v=u;