void topo_sort_r(vertex u, graph& g, deque<vertex>& order, vector<bool>& visited) { visited[u] = true; for (unsigned int i = 0; i != g.adj(u).size(); ++i) ...
確定! 回上一頁