adds the first path to the specified vertex . concode_field_sep Set<V> prevImprovedVertices concode_elem_sep Map<V,RankingPathElementList<V,E>> seenDataContainer concode_elem_sep V startVertex concode_elem_sep V endVertex concode_elem_sep int k concode_elem_sep Graph<V,E> graph concode_elem_sep Map<V,RankingPathElementList<V,E>> prevSeenDataContainer concode_elem_sep boolean startVertexEncountered concode_field_sep Set<V> next concode_elem_sep RankingPathElementList<V,E> getPathElements concode_elem_sep RankingPathElementList<V,E> createSeenData concode_elem_sep void savePassData concode_elem_sep boolean tryToAddNewPaths concode_elem_sep void assertKShortestPathsIterator concode_elem_sep Set<E> edgesOf concode_elem_sep boolean hasNext concode_elem_sep void encounterStartVertex concode_elem_sep void updateOutgoingVertices concode_elem_sep void remove
void function ( V arg0 , E arg1 ) { RankingPathElementList < V , E > loc0 = createSeenData ( arg0 , arg1 ) ; this . seenDataContainer . put ( arg0 , loc0 ) ; }