BellmanFordPathElement < V , E > function ( V arg0 , BellmanFordPathElement < V , E > arg1 ) { if ( this . vertexData == null ) { this . vertexData = new HashMap < V , BellmanFordPathElement < V , E >> ( ) ; } return this . vertexData . put ( arg0 , arg1 ) ; }
stores iterator-dependent data for a vertex that has been seen during the current pass . 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 Iterator<E> edgesOfIterator concode_elem_sep boolean isSeenVertex concode_elem_sep boolean relaxVertexAgain concode_elem_sep BellmanFordPathElement<V,E> putPrevSeenData