fr.lri.bd.olap.jung
Class WeightedShortestPath

java.lang.Object
  fr.lri.bd.olap.jung.WeightedShortestPath

All Implemented Interfaces:

edu.uci.ics.jung.algorithms.shortestpath.Distance

public class WeightedShortestPath
extends Object
implements edu.uci.ics.jung.algorithms.shortestpath.Distance

WeightedShortestPath is used for counting distance between nodes of graph

Author:

holubec

Constructor Summary

WeightedShortestPath(edu.uci.ics.jung.graph.Graph g, edu.uci.ics.jung.graph.Vertex root)
Default constructor

Method Summary

Number	getDistance(edu.uci.ics.jung.graph.ArchetypeVertex source, edu.uci.ics.jung.graph.ArchetypeVertex target)
Map	getDistanceMap(edu.uci.ics.jung.graph.ArchetypeVertex source)

Methods inherited from class java.lang.Object

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

Constructor Detail

WeightedShortestPath

public WeightedShortestPath(edu.uci.ics.jung.graph.Graph g,
                            edu.uci.ics.jung.graph.Vertex root)

Default constructor

Parameters:

g - JUNG graph

root - root vertex

Method Detail

getDistance

public Number getDistance(edu.uci.ics.jung.graph.ArchetypeVertex source,
                          edu.uci.ics.jung.graph.ArchetypeVertex target)

Specified by:

getDistance in interface edu.uci.ics.jung.algorithms.shortestpath.Distance

See Also:

Distance.getDistance(edu.uci.ics.jung.graph.ArchetypeVertex, edu.uci.ics.jung.graph.ArchetypeVertex)

getDistanceMap

public Map getDistanceMap(edu.uci.ics.jung.graph.ArchetypeVertex source)

Specified by:

getDistanceMap in interface edu.uci.ics.jung.algorithms.shortestpath.Distance

See Also:

Distance.getDistanceMap(edu.uci.ics.jung.graph.ArchetypeVertex)