|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.jgrapht.alg.HamiltonianCycle
public class HamiltonianCycle
This class will deal with finding the optimal or approximately optimal minimum tour (hamiltonian cycle) or commonly known as the Traveling Salesman Problem.
| Constructor Summary | |
|---|---|
HamiltonianCycle()
|
|
| Method Summary | ||
|---|---|---|
static
|
getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)
This method will return an approximate minimal traveling salesman tour (hamiltonian cycle). |
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public HamiltonianCycle()
| Method Detail |
|---|
public static <V,E> java.util.List<V> getApproximateOptimalForCompleteGraph(SimpleWeightedGraph<V,E> g)
V - E - g - is the graph to find the optimal tour for.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||