Returns the index of edge (from, to) in *edges or -1 if it is not in *edges.
| 187 | |
| 188 | // Returns the index of edge (from, to) in *edges or -1 if it is not in *edges. |
| 189 | static int EdgeIndex(Edges *edges, int from, int to) { |
| 190 | int i = 0; |
| 191 | while (i != edges->size() && |
| 192 | ((*edges)[i].from != from || (*edges)[i].to != to)) { |
| 193 | i++; |
| 194 | } |
| 195 | return i == edges->size() ? -1 : i; |
| 196 | } |
| 197 | |
| 198 | TEST(GraphCycles, RandomizedTest) { |
| 199 | Nodes nodes; |