List < V > function ( DirectedGraph < V , E > arg0 , V arg1 ) { List < V > loc0 = new ArrayList < V > ( ) ; Set < ? extends E > loc1 = arg0 . outgoingEdgesOf ( arg1 ) ; for ( E loc2 : loc1 ) { loc0 . add ( getOppositeVertex ( arg0 , loc2 , arg1 ) ) ; } return loc0 ; }
returns a list of vertices that are the direct successors of a specified vertex . if the graph is a multigraph vertices may appear more than once in the returned list . concode_field_sep PlaceHolder placeHolder concode_field_sep boolean addAllEdges concode_elem_sep void addGraphReversed concode_elem_sep List<V> predecessorListOf concode_elem_sep boolean addAllVertices concode_elem_sep boolean testIncidence concode_elem_sep List<V> getPathVertexList concode_elem_sep V getOppositeVertex concode_elem_sep List<V> neighborListOf concode_elem_sep UndirectedGraph<V,E> undirectedGraph concode_elem_sep E addEdgeWithVertices concode_elem_sep boolean addEdgeWithVertices concode_elem_sep E addEdgeWithVertices concode_elem_sep E addEdge concode_elem_sep boolean addGraph