graph

Interface GraphAlgorithmObserver<V>

Type Parameters:

V -

public interface GraphAlgorithmObserver<V>

A GraphAlgorithmObserver will register with a WeightedGraph to let it know that it is "watching". As algorithms are carried out on the WeightedGraph (BFS, DFS, Dijkstra), the graph will notify the Observer to let it know how the algorithms are progressing.

Author:

Fawzi Emad (C) 2016

Method Summary

Modifier and Type	Method and Description
void	notifyBFSHasBegun() Called by the graph to notify this Observer that a Breadth-First Search has been initiated.
void	notifyDFSHasBegun() Called by the graph to notify this Observer that a Depth-First-Search has been initiated.
void	notifyDijkstraHasBegun() Called by the graph to notify this observer that Dijkstra's algorithm has begun.
void	notifyDijkstraIsOver(java.util.List<V> path) Called by the graph to notify this observer that Dijkstra's algorithm is over.
void	notifyDijkstraVertexFinished(V vertexAddedToFinishedSet, java.lang.Integer costOfPath) Called by the graph to notify this observer that a vertex has been added to the "Finished Set" during Dijkstra's algorithm.
void	notifySearchIsOver() Called by the graph to notify this observer that the search (either DFS or BFS) is over.
void	notifyVisit(V vertexBeingVisited) Called by the graph to notify this Observer that a vertex is being "visited" during either DFS or BFS.

Method Detail

notifyDFSHasBegun

void notifyDFSHasBegun()

Called by the graph to notify this Observer that a Depth-First-Search has been initiated.

notifyBFSHasBegun

void notifyBFSHasBegun()

Called by the graph to notify this Observer that a Breadth-First Search has been initiated.

notifyVisit

void notifyVisit(V vertexBeingVisited)

Called by the graph to notify this Observer that a vertex is being "visited" during either DFS or BFS.

Parameters:

vertexBeingVisited -

notifySearchIsOver

void notifySearchIsOver()

Called by the graph to notify this observer that the search (either DFS or BFS) is over.

notifyDijkstraHasBegun

void notifyDijkstraHasBegun()

Called by the graph to notify this observer that Dijkstra's algorithm has begun.

notifyDijkstraVertexFinished

void notifyDijkstraVertexFinished(V vertexAddedToFinishedSet,
                                  java.lang.Integer costOfPath)

Called by the graph to notify this observer that a vertex has been added to the "Finished Set" during Dijkstra's algorithm. The second parameter is the "cost" (total weight) of the best path leading from the starting vertex to the one referenced by the first parameter.

Parameters:

vertexAddedToFinishedSet -

costOfPath -

notifyDijkstraIsOver

void notifyDijkstraIsOver(java.util.List<V> path)

Called by the graph to notify this observer that Dijkstra's algorithm is over.

Parameters:

path - A list of Vertices that are connected along edges, beginning with the "starting vertex" and ending with the "finishing vertex". This will be the optimal (lowest cost) path from start to finish.