returns an iterator to loop over outgoing edges edge of the vertex . concode_field_sep double epsilon concode_elem_sep String NEGATIVE_UNDIRECTED_EDGE concode_elem_sep V startVertex concode_elem_sep Map<V,BellmanFordPathElement<V,E>> vertexData concode_elem_sep Map<V,BellmanFordPathElement<V,E>> prevVertexData concode_elem_sep boolean startVertexEncountered concode_elem_sep Graph<V,E> graph concode_elem_sep List<V> prevImprovedVertices concode_field_sep List<V> next concode_elem_sep BellmanFordPathElement<V,E> createSeenData concode_elem_sep void savePassData concode_elem_sep BellmanFordPathElement<V,E> getSeenData concode_elem_sep void assertValidEdge concode_elem_sep void relaxVertex concode_elem_sep BellmanFordPathElement<V,E> getPrevSeenData concode_elem_sep boolean hasNext concode_elem_sep void encounterStartVertex concode_elem_sep void assertBellmanFordIterator concode_elem_sep double calculatePathCost concode_elem_sep void remove concode_elem_sep BellmanFordPathElement<V,E> getPathElement concode_elem_sep BellmanFordPathElement<V,E> putSeenData concode_elem_sep boolean isSeenVertex concode_elem_sep boolean relaxVertexAgain concode_elem_sep BellmanFordPathElement<V,E> putPrevSeenData
Iterator < E > function ( V arg0 ) { if ( this . graph instanceof DirectedGraph < ? , ? > ) { return ( ( DirectedGraph < V , E > ) this . graph ) . outgoingEdgesOf ( arg0 ) . iterator ( ) ; } else { return this . graph . edgesOf ( arg0 ) . iterator ( ) ; } }