(t, e)
| 25716 | } while (u !== s); |
| 25717 | } |
| 25718 | find(t, e) { |
| 25719 | let n = |
| 25720 | arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : 0; |
| 25721 | if ((t = +t) != t || (e = +e) != e) return -1; |
| 25722 | const r = n; |
| 25723 | let i; |
| 25724 | for (; (i = this._step(n, t, e)) >= 0 && i !== n && i !== r; ) n = i; |
| 25725 | return i; |
| 25726 | } |
| 25727 | _step(t, e, n) { |
| 25728 | const { |
| 25729 | inedges: r, |
no test coverage detected