| 4 | |
| 5 | |
| 6 | node_t index_edge(std::vector<std::pair<node_t, node_t>>& edges, const std::pair<node_t, node_t>& target) { |
| 7 | for (int i = edges.size() - 1;i >= 0;i--) { |
| 8 | if ((edges[i].first == target.first) && (edges[i].second == target.second)) { |
| 9 | return i; |
| 10 | } |
| 11 | } |
| 12 | return -1; |
| 13 | } |
| 14 | |
| 15 | |
| 16 | py::object _biconnected_dfs_record_edges(py::object G, py::object need_components) { |
no test coverage detected