Uses of Interface
org.jgrapht.alg.interfaces.HamiltonianPathSearchResult
Packages that use HamiltonianPathSearchResult
Package
Description
Algorithm related interfaces.
Graph tours and Hamiltonian path related algorithms.
-
Uses of HamiltonianPathSearchResult in org.jgrapht.alg.interfaces
Methods in org.jgrapht.alg.interfaces that return HamiltonianPathSearchResultModifier and TypeMethodDescriptionstatic <V,E> HamiltonianPathSearchResult <V, E> HamiltonianPathSearchResult.aborted(long statesExpanded) Creates a result for a search that was stopped by a state limit before completing.static <V,E> HamiltonianPathSearchResult <V, E> Creates a result for a successful search.Computes a Hamiltonian path in the given graph and returns a tri-stateHamiltonianPathSearchResult.static <V,E> HamiltonianPathSearchResult <V, E> HamiltonianPathSearchResult.provenAbsent(long statesExpanded) Creates a result for an exhaustive search that proved no Hamiltonian path exists. -
Uses of HamiltonianPathSearchResult in org.jgrapht.alg.tour
Methods in org.jgrapht.alg.tour that return HamiltonianPathSearchResultModifier and TypeMethodDescriptionBacktrackingHamiltonianPath.searchWithStateLimit(Graph<V, E> graph, long maxStates) Performs a Hamiltonian path search with an upper bound on the number of DFS states the solver may explore.