graph.traversal

Class DijkstraAlgorithm<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.traversal.DijkstraAlgorithm<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class DijkstraAlgorithm<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

An implementation of Dijkstra's algorithm for finding a path between two graph vertices in a graph

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
DijkstraAlgorithm() Sets default value of the directed parameter and leaves the edge empty
DijkstraAlgorithm(Graph<V,E> graph) Initialized the algorithm's parameters based on the properties of the graph
DijkstraAlgorithm(java.util.List<E> edges, boolean directed) Initializes the algorithm's parameters based on the given values

Method Summary

Modifier and Type	Method and Description
Path<V,E>	getPath(V source, V target) Finds a path in the given graph between two vertices if it exists.
Path<V,E>	getPath(V source, V target, java.util.List<V> excluding) Finds a path in the given graph between two vertices which doesn't contain certain specified vertices, if one exists.
void	setDirected(boolean directed)
void	setEdges(java.util.List<E> edges)

Methods inherited from class java.lang.Object

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

Constructor Detail

DijkstraAlgorithm

public DijkstraAlgorithm(Graph<V,E> graph)

Initialized the algorithm's parameters based on the properties of the graph

Parameters:

graph - Graph being traversed

DijkstraAlgorithm

public DijkstraAlgorithm(java.util.List<E> edges,
                         boolean directed)

Initializes the algorithm's parameters based on the given values

Parameters:

edges - Edges to be traverse

directed - Is the graph directed

DijkstraAlgorithm

public DijkstraAlgorithm()

Sets default value of the directed parameter and leaves the edge empty

Method Detail

getPath

public Path<V,E> getPath(V source,
                         V target)

Finds a path in the given graph between two vertices if it exists.

Parameters:

source - Source vertex

target - Target (destination) vertex

Returns:

A path from source to target if it exists, otherwise null

getPath

public Path<V,E> getPath(V source,
                         V target,
                         java.util.List<V> excluding)

Finds a path in the given graph between two vertices which doesn't contain certain specified vertices, if one exists.

Parameters:

source - Source vertex

target - Target (destination) vertex

excluding - Vertices that cannot be on the path

Returns:

A path from source to target not containing excluding if it exists, otherwise null

setEdges

public void setEdges(java.util.List<E> edges)

Parameters:

edges - Edges to set

setDirected

public void setDirected(boolean directed)

Parameters:

directed - Indicator if the graph is directed to set