returns a collection of ` interesting ' states for the given vertex . depending on the implementation , this could contain a single optimal state , a set of pareto-optimal states , or even states that are not known to be optimal but are judged interesting by some other criteria . concode_field_sep DominanceFunction dominanceFunction concode_elem_sep Logger LOG concode_elem_sep RoutingRequest options concode_elem_sep Map<Vertex,List<State>> stateSets concode_field_sep boolean add concode_elem_sep State getState concode_elem_sep Collection<State> getAllStates concode_elem_sep GraphPath getPath concode_elem_sep Set<Vertex> getVertices concode_elem_sep String toString concode_elem_sep RoutingRequest getOptions concode_elem_sep void dump concode_elem_sep boolean visit concode_elem_sep List<GraphPath> getPaths concode_elem_sep List<GraphPath> getPaths concode_elem_sep int getVertexCount
List < State > function ( Vertex arg0 ) { return stateSets . get ( arg0 ) ; }