Searched refs:neighbors (Results 1 – 2 of 2) sorted by relevance
34 private Map<V,List<V>> neighbors = new HashMap<V, List<V>>(); field in DirectedGraph42 for (V v : neighbors.keySet()) { in toString()43 s.append("\n " + v + " -> " + neighbors.get(v)); in toString()52 if (neighbors.containsKey(vertex)) { in addVertice()55 neighbors.put(vertex, new ArrayList<V>()); in addVertice()62 return neighbors.containsKey(vertex); in contains()72 neighbors.get(from).add(to); in addEdge()84 neighbors.get(from).remove(to); in removeEdge()93 for (V v: neighbors.keySet()) { in inDegree()97 for (V from: neighbors.keySet()) { in inDegree()[all …]
155 neighbors - nodes attached to the same link.183 receiving packets from, and interacting with neighbors over, the186 with neighbors over, the latter (non-forwarding) interfaces.