(&self)
| 934 | .take(MAX_PATH_NUM) |
| 935 | .collect::<Vec<_>>(); |
| 936 | for path in cycle_paths { |
| 937 | // `path` forms a cycle, where adjacent nodes are directly connected and last_node connects to first_node. |
| 938 | // Different `path`s beginning with different nodes may denote the same cycle if their edges are the same. |
| 939 | // Thus we use `edge_sets` to deduplicate the cycle paths. |
| 940 | let set = path |
| 941 | .iter() |
| 942 | .zip(path.iter().skip(1).chain(path.first())) |
| 943 | .map(|(a, b)| (*a, *b)) |
| 944 | .collect::<FxHashSet<_>>(); |
nothing calls this directly
no outgoing calls
no test coverage detected