berack96.lib.graph.visit

Interface VisitDistance<V,W extends java.lang.Number>

Type Parameters:

V - the vertex

W - the weight

All Superinterfaces:

VisitStrategy<V,W>

All Known Implementing Classes:

Dijkstra

public interface VisitDistance<V,W extends java.lang.Number>
extends VisitStrategy<V,W>

Interface that is helpful for implements visit that needs to retrieve the distance between a vertex to all the others

Author:

Berack96

Method Summary

Modifier and Type	Method and Description
java.util.Map<V,java.util.List<Edge<V,W>>>	getLastDistance() Get the last calculated distance to all the possible destinations The map contains all the possible vertices that are reachable from the source set in the visit If there is no path between the destination and the source, then null is returned as accordingly to the map interface If the visit is not already been done, then the map is null.
V	getLastSource() Get the last source vertex of the visit for calculating the destinations. Returns null if the visit is not already been done

Methods inherited from interface berack96.lib.graph.visit.VisitStrategy

visit

Method Detail

getLastDistance

java.util.Map<V,java.util.List<Edge<V,W>>> getLastDistance()
                                                    throws java.lang.NullPointerException

Get the last calculated distance to all the possible destinations
The map contains all the possible vertices that are reachable from the source set in the visit
If there is no path between the destination and the source, then null is returned as accordingly to the map interface
If the visit is not already been done, then the map is null.

Returns:

the last distance

Throws:

java.lang.NullPointerException - if the visit is not already been done

getLastSource

V getLastSource()

Get the last source vertex of the visit for calculating the destinations.
Returns null if the visit is not already been done

Returns:

the last vertex