Method dfs_forward

graphs/directed_graph_list.py:200–205

(self, vertex, stack, visited)

        return stack

    def dfs_forward(self, vertex, stack, visited):
        if vertex not in visited:
            visited.add(vertex)
            for u in self.get_neighbor(vertex):
                self.dfs_forward(u, stack, visited)
            stack.append(vertex)

    def scc_dfs_reverse_pass(self, stack):
        components = []