以下演算法為何種演算法？ Mark the current vertex, u, visited and enter it in the discovery order list for each vertex, v, adjacent to the current vertex, u if v has not been visited Set parent of v to u. Recursively apply this algorithm starting at v. Mark u finished and enter u into the finish order list.