A B C D E F G I M O P Q R S T V

A

addEdge(Object, Object, int) - Method in interface org.rollerjm.graph.IGraph

addEdge(Object, Object, int) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

add an new edge in the graph.

addPath(Path) - Method in class org.rollerjm.graph.Path

addVertex(Object) - Method in class org.rollerjm.graph.Path

addVertex(Object) - Method in interface org.rollerjm.graph.IGraph

addVertex(Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

add a new vertex in the graph

adjacencyMatrix - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

Adjacency Matrix AM, with AM[start][destination] = weight.

AdjacencyMatrixGraph - class org.rollerjm.graph.AdjacencyMatrixGraph.

Title: graphs

AdjacencyMatrixGraph(int) - Constructor for class org.rollerjm.graph.AdjacencyMatrixGraph

adjacencyMatrixInversed - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

Adjacency Matrix inversed (mathematical meaning)

B

buildShortestPath(Object, Object) - Method in class org.rollerjm.graph.Dijkstra

used the predecessorsMap to build the shortest path from a start vertex to a destination vertex

C

checkVertexExist(Object) - Method in class org.rollerjm.graph.Dijkstra

clear() - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue

Remove all the elements of the queue

clone() - Method in class org.rollerjm.graph.Path

clone the path, all the objects in the path should be cloneables

compareTo(Object) - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement

Implementation of compareTo

D

dequeueLowestPriorityElement() - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue

destination - Variable in class org.rollerjm.graph.PathFinder

Where we gonna go now ?

determinedVerticesSet - Variable in class org.rollerjm.graph.Dijkstra

the set of determines vertices V

dijkstra - Variable in class org.rollerjm.graph.PathFinder

We need our favourite algorithm

Dijkstra - class org.rollerjm.graph.Dijkstra.

Title: graphs

Dijkstra.PriorityQueue - class org.rollerjm.graph.Dijkstra.PriorityQueue.

Title: graphs

Dijkstra.PriorityQueue.QueueElement - class org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement.

Title: graphs

Dijkstra.PriorityQueue.QueueElement(Object, int) - Constructor for class org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement

Dijkstra.PriorityQueue() - Constructor for class org.rollerjm.graph.Dijkstra.PriorityQueue

Dijkstra(IGraph) - Constructor for class org.rollerjm.graph.Dijkstra

E

edgeExist(Object, Object) - Method in interface org.rollerjm.graph.IGraph

edgeExist(Object, Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

Remove an edge to the graph

element - Variable in class org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement

any object

F

findPaths(Object, Object, int) - Method in class org.rollerjm.graph.PathFinder

Explore the graph from a start vertex to a destination vertex and find all the paths which have a length <= maxLength.

findPathsWithExactLength(Object, Object, int) - Method in class org.rollerjm.graph.PathFinder

findPathsWithMaximumDistance(Object, Object, int) - Method in class org.rollerjm.graph.PathFinder

Explore the graph from a start vertex to a destination vertex and find all the paths which have a total distance <= maxDistance.

findPathsWithMaximumLength(Object, Object, int) - Method in class org.rollerjm.graph.PathFinder

G

get(int) - Method in class org.rollerjm.graph.Path

getAdjacentsFromMatrix(Object, int[][]) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

This method is used by getAdjacentVertices and getPredecessors

getAdjacentVertices(Object) - Method in interface org.rollerjm.graph.IGraph

getAdjacentVertices(Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getEdgeWeight(Object, Object) - Method in interface org.rollerjm.graph.IGraph

getEdgeWeight(Object, Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getEdgeWeight(Path) - Method in interface org.rollerjm.graph.IGraph

getEdgeWeight(Path) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getLast() - Method in class org.rollerjm.graph.Path

getLength() - Method in class org.rollerjm.graph.Path

getPredecessors(Object) - Method in interface org.rollerjm.graph.IGraph

getPredecessors(Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getShortestPath(Object, Object) - Method in class org.rollerjm.graph.PathFinder

wrapper around Dijkstra method

getShortestPath(Object, Object) - Method in class org.rollerjm.graph.Dijkstra

getShortestPathFromStart(Object) - Method in class org.rollerjm.graph.Dijkstra

getShortestWeightDistance(Object, Object) - Method in class org.rollerjm.graph.PathFinder

wrapper around Dijkstra method

getShortestWeightDistance(Object, Object) - Method in class org.rollerjm.graph.Dijkstra

getSize() - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue

getVertexIndex(Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getVertexObject(int) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

getVerticesNumber() - Method in interface org.rollerjm.graph.IGraph

getVerticesNumber() - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

graph - Variable in class org.rollerjm.graph.PathFinder

the graph we are gonna to explore

graph - Variable in class org.rollerjm.graph.Dijkstra

The graph on which we apply the algorithm

I

IGraph - interface org.rollerjm.graph.IGraph.

Title: graphs

indexCurrentVertex - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

Current number of vertices contained in the graph

INFINITE - Static variable in class org.rollerjm.graph.Dijkstra

the INFINITE, the maximum weight should be < to this value

insert(Object, int) - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue

isEmpty() - Method in class org.rollerjm.graph.Dijkstra.PriorityQueue

M

maxDistance - Variable in class org.rollerjm.graph.PathFinder

The total distance.

maxLength - Variable in class org.rollerjm.graph.PathFinder

The lenght of a path is different from its distance.

O

objectsArray - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

Array used to map the index used in the Adjacency Matrix and the object contained in a vertex I.e.

org.rollerjm.graph - package org.rollerjm.graph

P

Path - class org.rollerjm.graph.Path.

Title: graphs

Path() - Constructor for class org.rollerjm.graph.Path

Path(List) - Constructor for class org.rollerjm.graph.Path

PathFinder - class org.rollerjm.graph.PathFinder.

Title: graphs

PathFinder(IGraph) - Constructor for class org.rollerjm.graph.PathFinder

predecessorsMap - Variable in class org.rollerjm.graph.Dijkstra

the result map of predecessors of the shortest path from a start vertex after running the algorithm

priority - Variable in class org.rollerjm.graph.Dijkstra.PriorityQueue.QueueElement

Priority.

Q

queue - Variable in class org.rollerjm.graph.Dijkstra.PriorityQueue

the queue is implemented by a TreeSet because it includes a sort algorithm !

R

relax(Object) - Method in class org.rollerjm.graph.Dijkstra

remainingVertices - Variable in class org.rollerjm.graph.Dijkstra

the list of remaining vertices Q

removeEdge(Object, Object) - Method in interface org.rollerjm.graph.IGraph

removeEdge(Object, Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

Remove an edge

runAlgorihtm(Object, Object) - Method in class org.rollerjm.graph.Dijkstra

Run the algorihtm see http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/dijkstra.html for details

S

searchDistance(Path) - Method in class org.rollerjm.graph.PathFinder

Recursive method.

searchLength(Path) - Method in class org.rollerjm.graph.PathFinder

Recursive method.

setShortestPathFromStart(Object, int) - Method in class org.rollerjm.graph.Dijkstra

shortestPathMap - Variable in class org.rollerjm.graph.Dijkstra

the result map of the shortest path distances from a start vertex after running the algorithm

solutionsList - Variable in class org.rollerjm.graph.PathFinder

list of Path

T

toString() - Method in class org.rollerjm.graph.Path

V

vertexExist(Object) - Method in interface org.rollerjm.graph.IGraph

vertexExist(Object) - Method in class org.rollerjm.graph.AdjacencyMatrixGraph

verticesList - Variable in class org.rollerjm.graph.Path

List which contains the vertices

verticesMap - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

Map used to map an object contained in a vertex and the index used in the Adjacency Matrix.

verticesNumber - Variable in class org.rollerjm.graph.AdjacencyMatrixGraph

number of vertices in the graph

A B C D E F G I M O P Q R S T V