这是DFS系列的第一篇 . 首先给出一个重要的定理.该定理来自<算法导论>. An undirected graph may entail some ambiguity in how we classify edges,since (u, v) and (v, u) are really the same edge. In such a case, we classify the edge according to whichever of (u, v) or (v, u) the searc…