Conditions | 4 |
Total Lines | 11 |
Lines | 0 |
Ratio | 0 % |
Changes | 1 | ||
Bugs | 0 | Features | 0 |
1 | from pyalgs.data_structures.commons.stack import Stack |
||
10 | def __init__(self, G): |
||
11 | if isinstance(G, DirectedEdgeWeightedGraph): |
||
12 | G = G.to_digraph() |
||
13 | |||
14 | self.reversePostOrder = Stack.create() |
||
15 | vertex_count = G.vertex_count() |
||
16 | self.marked = [False] * vertex_count |
||
17 | |||
18 | for v in range(vertex_count): |
||
19 | if not self.marked[v]: |
||
20 | self.dfs(G, v) |
||
21 | |||
30 | return self.reversePostOrder.iterate() |