pseudocode to compute depth first number and Low


Algorithm ART(u,v)    
   	// u is a start vertex for depth first search. v is its parent if any
  	 // in the depth first spanning tree.  It is assumed that the "global"
 	 // array dfn is initialized to zero and that the "global" variable
  	 // num is initialized to 1.  n is the number of vertices in G.
{
	 DFN[u] = num; L[u] = num; num = num + 1;
 	 for each vertex w adjacent from u do
   	{
   		 if  (DFN[w] = 0)
     		 {
       			ART(w,u);      // w is unvisited
       			L[u] = min(L[u],L[w])	 ;               
     		  }
    		else if (w != v)  L[u] = min (L[u], DFN[w]);
	 }
}