| 145 | } |
| 146 | |
| 147 | std::vector<NodeID> any_order(const NodeTree &tree) |
| 148 | { |
| 149 | |
| 150 | auto count = tree.nodeCount(); |
| 151 | std::vector<NodeID> result; |
| 152 | result.reserve(count); |
| 153 | |
| 154 | for (auto i = 0; i < count; ++i) |
| 155 | { |
| 156 | result.push_back(NodeID(i)); |
| 157 | } |
| 158 | |
| 159 | return result; |
| 160 | } |
| 161 | |
| 162 | std::vector<NodeID> post_order(const NodeTree &tree) |
| 163 | { |
no test coverage detected