Description: For a connected graph G, use depth first search method, identify the connected graph all key points. As below.
Input: first input connected graph of the node number n G, number of the edges of the m and search the start of the node number and enter the edge (u, v)
Output: first output DFN and LOW array value, and then output all key points.
To Search:
File list (Check if you may need any files):
新建文本文档.txt
Download