A C D E F G H I K O P R S T V

A

add(E) - Method in class com.savarese.algorithms.graph.AdjacencyList

add(E) - Method in interface com.savarese.algorithms.graph.Graph

Adds an edge to the graph, mapping the source vertex to the edge.

addVertex(V) - Method in class com.savarese.algorithms.graph.AdjacencyList

addVertex(V) - Method in interface com.savarese.algorithms.graph.Graph

Adds a vertex to the graph with no edges associated with it.

AdjacencyList<V,E extends Edge<V,?>> - Class in com.savarese.algorithms.graph

An AdjacencyList represents a graph by mapping a set of vertices to the set of edges emanating from each vertex.

AdjacencyList() - Constructor for class com.savarese.algorithms.graph.AdjacencyList

Creates an empty adjacency list.

C

clear() - Method in class com.savarese.algorithms.graph.AdjacencyList

clear() - Method in interface com.savarese.algorithms.graph.Graph

Removes all vertices and edges from the graph.

clear() - Method in class com.savarese.algorithms.spatial.KDTree

Removes all elements from the container, leaving it empty.

clone() - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns a copy of the point.

com.savarese.algorithms.graph - package com.savarese.algorithms.graph

Algorithms that operate on graphs.

com.savarese.algorithms.spatial - package com.savarese.algorithms.spatial

Spatial data structures.

containsKey(Object) - Method in class com.savarese.algorithms.spatial.KDTree

Returns true if the container contains a mapping for the specified key.

containsValue(Object) - Method in class com.savarese.algorithms.spatial.KDTree

Returns true if the container contains a mapping with the specified value.

D

DijkstraShortestPathFinder<V,E extends Edge<V,java.lang.Integer>> - Class in com.savarese.algorithms.graph

The DijkstraShortestPathFinder class implements Dijkstra's algorithm, which solves the single source shortest paths problem.

DijkstraShortestPathFinder() - Constructor for class com.savarese.algorithms.graph.DijkstraShortestPathFinder

E

Edge<V,W> - Class in com.savarese.algorithms.graph

An Edge represents a directed or undirected connection between two vertices with an associated weight.

Edge(V, V, W) - Constructor for class com.savarese.algorithms.graph.Edge

Creates an Edge between source and destination vertices, assigning a weight to the link.

edgeSet(V) - Method in class com.savarese.algorithms.graph.AdjacencyList

edgeSet(V) - Method in interface com.savarese.algorithms.graph.Graph

Returns a set containing all of the edges emanating from a given vertex.

entrySet() - Method in class com.savarese.algorithms.spatial.KDTree

Returns a Set view of the point to value mappings in the KDTree.

equals(Object) - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns true if the specified object is equal to the GenericPoint.

equals(Object) - Method in class com.savarese.algorithms.spatial.KDTree

Returns true if the object contains the same mappings, false if not.

F

findPath(Graph<V, E>, V) - Method in class com.savarese.algorithms.graph.DijkstraShortestPathFinder

Finds all the shortest paths in the given graph between the given source vertex and all other vertices in the graph.

findPath(Graph<V, E>, V) - Method in interface com.savarese.algorithms.graph.SingleSourcePathFinder

Finds one or more paths betwen the source vertex and one or more destinations in the given graph.

G

GenericPoint<Coord extends java.lang.Comparable<? super Coord>> - Class in com.savarese.algorithms.spatial

A Point implementation supporting k dimensions.

GenericPoint(int) - Constructor for class com.savarese.algorithms.spatial.GenericPoint

Constructs a GenericPoint with the specified dimensions.

GenericPoint(Coord, Coord) - Constructor for class com.savarese.algorithms.spatial.GenericPoint

Two-dimensional convenience constructor.

GenericPoint(Coord, Coord, Coord) - Constructor for class com.savarese.algorithms.spatial.GenericPoint

Three-dimensional convenience constructor.

get(Object) - Method in class com.savarese.algorithms.spatial.KDTree

Retrieves the value at the given location.

getCoord(int) - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns the value of the coordinate for the specified dimension.

getCoord(int) - Method in interface com.savarese.algorithms.spatial.Point

Returns the value of the coordinate of the given dimension.

getDestination() - Method in class com.savarese.algorithms.graph.Edge

Returns the destination vertex.

getDimensions() - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns the number of dimensions of the point.

getDimensions() - Method in interface com.savarese.algorithms.spatial.Point

Returns the number of dimensions in the point.

getDistance(V) - Method in interface com.savarese.algorithms.graph.SingleSourcePath

Returns the distance to the given destination.

getPath(V, List<V>) - Method in interface com.savarese.algorithms.graph.SingleSourcePath

Appends a list of vertices which form a path between the source and given destination.

getSource() - Method in class com.savarese.algorithms.graph.Edge

Returns the source vertex.

getSource() - Method in interface com.savarese.algorithms.graph.SingleSourcePath

Returns the source vertex for each path.

getWeight() - Method in class com.savarese.algorithms.graph.Edge

Returns the edge weight.

Graph<V,E extends Edge<V,?>> - Interface in com.savarese.algorithms.graph

A Graph is a collection of vertices and the edges emanating from them.

H

hashCode() - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns the hash code value for this point.

hashCode() - Method in class com.savarese.algorithms.spatial.KDTree

Returns the hash code value for this map.

I

INFINITY - Static variable in class com.savarese.algorithms.graph.DijkstraShortestPathFinder

isEmpty() - Method in class com.savarese.algorithms.spatial.KDTree

Returns true if the container has no elements, false if it contains one or more elements.

iterator(P, P) - Method in class com.savarese.algorithms.spatial.KDTree

iterator(P, P) - Method in interface com.savarese.algorithms.spatial.RangeSearchTree

Returns an iterator for mappings that are contained in the rectangle defined by the given lower left-hand and upper right-hand corners.

K

KDTree<Coord extends java.lang.Comparable<? super Coord>,P extends Point<Coord>,V> - Class in com.savarese.algorithms.spatial

A k-d tree divides a k-dimensional space relative to the points it contains by storing them in a binary tree, discriminating by a different dimension at each level of the tree.

KDTree() - Constructor for class com.savarese.algorithms.spatial.KDTree

Creates a two-dimensional KDTree.

KDTree(int) - Constructor for class com.savarese.algorithms.spatial.KDTree

Creates a KDTree of the specified number of dimensions.

keySet() - Method in class com.savarese.algorithms.spatial.KDTree

Returns a Set view of the point keys for the mappings in the KDTree.

O

optimize() - Method in class com.savarese.algorithms.spatial.KDTree

Optimizes the performance of future search operations by balancing the KDTree.

P

Point<Coord extends java.lang.Comparable<? super Coord>> - Interface in com.savarese.algorithms.spatial

The Point interface represents a point in a k-dimensional space.

put(P, V) - Method in class com.savarese.algorithms.spatial.KDTree

Inserts a point value pair into the tree, preserving the spatial ordering.

putAll(Map<? extends P, ? extends V>) - Method in class com.savarese.algorithms.spatial.KDTree

Copies all of the point-value mappings from the given Map into the KDTree.

R

RangeSearchTree<Coord extends java.lang.Comparable<? super Coord>,P extends Point<Coord>,V> - Interface in com.savarese.algorithms.spatial

A RangeSearchTree is a spatial data structure that supports the retrieval of data associated with point keys as well as the searching of data that occurs within a specified range of points.

remove(Object) - Method in class com.savarese.algorithms.spatial.KDTree

Removes the point-value mapping corresponding to the given point key.

S

setCoord(int, Coord) - Method in class com.savarese.algorithms.spatial.GenericPoint

Sets the value of the coordinate for the specified dimension.

SingleSourcePath<V,W> - Interface in com.savarese.algorithms.graph

A SingleSourcePath represents a solution to a single source path finding problem, containing one path from a single source vertex to one or more destinations.

SingleSourcePathFinder<V,W,E extends Edge<V,W>> - Interface in com.savarese.algorithms.graph

A SingleSourcePathFinder is a path finding algorithm that finds paths between a single source and one or more destinations meeting some criteria (e.g., shortest path).

size() - Method in class com.savarese.algorithms.graph.AdjacencyList

size() - Method in interface com.savarese.algorithms.graph.Graph

Returns the number of vertices in the graph.

size() - Method in class com.savarese.algorithms.spatial.KDTree

Returns the number of point-value mappings in the KDTree.

T

toString() - Method in class com.savarese.algorithms.spatial.GenericPoint

Returns a string representation of the point, listing its coordinate values in order.

V

values() - Method in class com.savarese.algorithms.spatial.KDTree

Returns a Collection view of the values contained in the KDTree.

vertexSet() - Method in class com.savarese.algorithms.graph.AdjacencyList

vertexSet() - Method in interface com.savarese.algorithms.graph.Graph

Returns the set of vertices in the graph.

A C D E F G H I K O P R S T V