| 192 | } |
| 193 | |
| 194 | void GetPostOrder(const Graph& g, std::vector<Node*>* order, |
| 195 | const NodeComparator& stable_comparator, |
| 196 | const EdgeFilter& edge_filter) { |
| 197 | order->clear(); |
| 198 | DFS(g, nullptr, [order](Node* n) { order->push_back(n); }, stable_comparator, |
| 199 | edge_filter); |
| 200 | } |
| 201 | |
| 202 | void GetReversePostOrder(const Graph& g, std::vector<Node*>* order, |
| 203 | const NodeComparator& stable_comparator, |