題組內容

4. The following figure shown in right-hand side is a depth first spanning
tree DFS(3), which the source vertex is the vertex 3, for the following
left connected graph G, and the numbers outside the vertices are depth
first number (dfn) of the vertex.

a. Write out the low values of each vertex for the depth first spanning tree with root = 3 based on the equation low(u) = min{dfn(u), min{low(w)|w is a child of u}, min{dfn(w)|(u, w) is a back edge}}. (10%)