berack96.lib.graph.visit

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

Type Parameters:

V - the vertex

W - the weight

All Superinterfaces:

VisitStrategy<V,W>

public interface VisitDistSourceDest<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.List<Edge<V,W>>	distance(Graph<V,W> graph, V source, V destination) Get the distance from the source to the destination The list contains the minimum path from the vertex marked as source to the destination vertex

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

visit

Method Detail

distance

java.util.List<Edge<V,W>> distance(Graph<V,W> graph,
                                   V source,
                                   V destination)
                            throws java.lang.NullPointerException,
                                   java.lang.IllegalArgumentException

Get the distance from the source to the destination
The list contains the minimum path from the vertex marked as source to the destination vertex

Parameters:

graph - the graph were to find the min path

source - the source vertex

destination - the destination vertex

Returns:

the distance

Throws:

java.lang.NullPointerException - if one of the vertex is null

java.lang.IllegalArgumentException - if one of the vertex is not contained in the graph