equal
deleted
inserted
replaced
207 } |
207 } |
208 if (!visited.contains(node)) { |
208 if (!visited.contains(node)) { |
209 visited.add(node); |
209 visited.add(node); |
210 edges.get(node).stream() |
210 edges.get(node).stream() |
211 .filter(e -> includeAdjacent || !node.equals(u) || !e.equals(v)) |
211 .filter(e -> includeAdjacent || !node.equals(u) || !e.equals(v)) |
212 .forEach(e -> stack.push(e)); |
212 .forEach(stack::push); |
213 } |
213 } |
214 } |
214 } |
215 assert !visited.contains(v); |
215 assert !visited.contains(v); |
216 return false; |
216 return false; |
217 } |
217 } |