Uses of Class
org.jgrapht.alg.tour.NearestInsertionHeuristicTSP.Closest

Packages that use NearestInsertionHeuristicTSP.Closest

Package	Description
org.jgrapht.alg.tour	Graph tours related algorithms.

Uses of NearestInsertionHeuristicTSP.Closest in org.jgrapht.alg.tour

Classes in org.jgrapht.alg.tour that implement interfaces with type arguments of type NearestInsertionHeuristicTSP.Closest

Modifier and Type	Class	Description
private static class	NearestInsertionHeuristicTSP.Closest<V>	Class holding data for the closest unvisited vertex to a particular vertex in the tour.

Methods in org.jgrapht.alg.tour that return NearestInsertionHeuristicTSP.Closest

Modifier and Type	Method	Description
private NearestInsertionHeuristicTSP.Closest<V>	NearestInsertionHeuristicTSP.chooseClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>> closestVertices)	Chooses the closest unvisited vertex to the sub-tour
private NearestInsertionHeuristicTSP.Closest<V>	NearestInsertionHeuristicTSP.getClosest(V tourVertex, Set<V> unvisited, Graph<V,E> graph)	Determines closest unvisited vertex to a vertex in the current tour

Methods in org.jgrapht.alg.tour that return types with arguments of type NearestInsertionHeuristicTSP.Closest

Modifier and Type	Method	Description
private Map<V, NearestInsertionHeuristicTSP.Closest<V>>	NearestInsertionHeuristicTSP.getClosest(List<V> tourVertices, Set<V> unvisited, Graph<V,E> graph)	Initialise the Map storing closest unvisited vertex for each tour vertex

Methods in org.jgrapht.alg.tour with parameters of type NearestInsertionHeuristicTSP.Closest

Modifier and Type	Method	Description
int	NearestInsertionHeuristicTSP.Closest.compareTo(NearestInsertionHeuristicTSP.Closest<V> o)
private void	NearestInsertionHeuristicTSP.updateClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>> currentClosest, NearestInsertionHeuristicTSP.Closest<V> chosen, Set<V> unvisited, Graph<V,E> graph)	Update the Map storing closest unvisited vertex for each tour vertex

Method parameters in org.jgrapht.alg.tour with type arguments of type NearestInsertionHeuristicTSP.Closest

Modifier and Type	Method	Description
private List<V>	NearestInsertionHeuristicTSP.augment(List<V> subtour, Map<V, NearestInsertionHeuristicTSP.Closest<V>> closestVertices, Set<V> unvisited, Graph<V,E> graph)	Augment an existing tour to give a complete tour
private NearestInsertionHeuristicTSP.Closest<V>	NearestInsertionHeuristicTSP.chooseClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>> closestVertices)	Chooses the closest unvisited vertex to the sub-tour
private void	NearestInsertionHeuristicTSP.updateClosest(Map<V, NearestInsertionHeuristicTSP.Closest<V>> currentClosest, NearestInsertionHeuristicTSP.Closest<V> chosen, Set<V> unvisited, Graph<V,E> graph)	Update the Map storing closest unvisited vertex for each tour vertex