| 200 | } |
| 201 | |
| 202 | void GetReversePostOrder(const Graph& g, std::vector<Node*>* order, |
| 203 | const NodeComparator& stable_comparator, |
| 204 | const EdgeFilter& edge_filter) { |
| 205 | GetPostOrder(g, order, stable_comparator, edge_filter); |
| 206 | std::reverse(order->begin(), order->end()); |
| 207 | } |
| 208 | |
| 209 | bool PruneForReverseReachability(Graph* g, |
| 210 | std::unordered_set<const Node*> start) { |