org.jgrapht.alg.interfaces

Interface TSPAlgorithm<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Known Implementing Classes:

TwoApproxMetricTSP

public interface TSPAlgorithm<V,E>

An algorithm solving the Travelling salesman problem (TSP).

Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

Author:

Dimitrios Michail

Method Summary

Modifier and Type	Method and Description
GraphPath<V,E>	getTour(Graph<V,E> graph) Computes a tour.

Method Detail

getTour

GraphPath<V,E> getTour(Graph<V,E> graph)

Computes a tour.

Parameters:

graph - the input graph

Returns:

a tour