Uses of Interface
org.jgrapht.alg.interfaces.HamiltonianPathSearchResult

Packages that use HamiltonianPathSearchResult

Package	Description
org.jgrapht.alg.interfaces	Algorithm related interfaces.
org.jgrapht.alg.tour	Graph tours and Hamiltonian path related algorithms.

Uses of HamiltonianPathSearchResult in org.jgrapht.alg.interfaces

Methods in org.jgrapht.alg.interfaces that return HamiltonianPathSearchResult

Modifier and Type	Method	Description
static <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>	HamiltonianPathSearchResult.found(GraphPath<V,E> path, long statesExpanded)	Creates a result for a successful search.
HamiltonianPathSearchResult<V,E>	HamiltonianPathAlgorithm.getPath(Graph<V,E> graph)	Computes a Hamiltonian path in the given graph and returns a tri-state HamiltonianPathSearchResult.
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 HamiltonianPathSearchResult

Modifier and Type	Method	Description
HamiltonianPathSearchResult<V,E>	BacktrackingHamiltonianPath.getPath(Graph<V,E> graph)
HamiltonianPathSearchResult<V,E>	DagHamiltonianPath.getPath(Graph<V,E> graph)
HamiltonianPathSearchResult<V,E>	HeldKarpHamiltonianPath.getPath(Graph<V,E> graph)
HamiltonianPathSearchResult<V,E>	BacktrackingHamiltonianPath.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.