在强连通分支算法中，选择任何顶点做起始点来执行深度优先搜索遍历，得到的强连通分支的解相同。-In the strongly connected branching algorithm, choose any vertex make a starting point to implement the depth-first search traversal obtained strongly connected branch of the same solution.