returns a list of vertices which are adjacent to a specified vertex . if the graph is a multigraph , vertices may appear more than once in the returned list . because a list of neighbors can not be efficiently maintained , it is reconstructed on every invocation , by duplicating entries in the neighbor set . it is thus more efficient to use #neighborsof object unless duplicate neighbors are important . concode_field_sep Map<V,ModifiableInteger> neighborCounts concode_elem_sep Map<V,Neighbors<V,E>> neighborMap concode_elem_sep Set<V> neighborSet concode_elem_sep Graph<V,E> graph concode_field_sep void edgeAdded concode_elem_sep void removeNeighbor concode_elem_sep Set<V> neighborsOf concode_elem_sep void edgeRemoved concode_elem_sep List<V> getNeighborList concode_elem_sep Neighbors<V,E> getNeighbors concode_elem_sep Set<V> getNeighbors concode_elem_sep void addNeighbor concode_elem_sep void vertexAdded concode_elem_sep void vertexRemoved
List < V > function ( V arg0 ) { return getNeighbors ( arg0 ) . getNeighborList ( ) ; }