net.sf.jsort.graph
Class DistanceGraphConverter

java.lang.Object
  net.sf.jsort.graph.DistanceGraphConverter

public class DistanceGraphConverter
extends java.lang.Object

This class compute a directed graph from another directed graph. This compute the minimum cost path between each pair of vertex over the graph used as input. The resulting graph can be used in tour algorithms.

Author:

Domingos Creado

Constructor Summary

DistanceGraphConverter()

Method Summary

edu.uci.ics.jung.graph.DirectedGraph

computeShortestPathGraph(edu.uci.ics.jung.graph.Graph graph, java.util.Set vertex, java.lang.Object pathKey, WeightResolver weightResolver, java.lang.Object weightKey, AlgorithmPath algorithmPath)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DistanceGraphConverter

public DistanceGraphConverter()

Method Detail

computeShortestPathGraph

public edu.uci.ics.jung.graph.DirectedGraph computeShortestPathGraph(edu.uci.ics.jung.graph.Graph graph,
                                                                     java.util.Set vertex,
                                                                     java.lang.Object pathKey,
                                                                     WeightResolver weightResolver,
                                                                     java.lang.Object weightKey,
                                                                     AlgorithmPath algorithmPath)
                                                              throws java.lang.CloneNotSupportedException

Throws:

java.lang.CloneNotSupportedException