| 136 | } |
| 137 | |
| 138 | private void validate(Iterable<Integer> v, Iterable<Integer> w) { |
| 139 | if (v == null || w == null) throw new IllegalArgumentException(); |
| 140 | for (Integer i : v) |
| 141 | if (i == null || i < 0 || i >= g.V()) throw new IllegalArgumentException(); |
| 142 | for (Integer i : w) |
| 143 | if (i == null || i < 0 || i >= g.V()) throw new IllegalArgumentException(); |
| 144 | } |
| 145 | |
| 146 | // length of shortest ancestral path between any vertex in v and any vertex in w; -1 if no such path |
| 147 | public int length(Iterable<Integer> v, Iterable<Integer> w) { |