Index

A C D E G H I L M N O P R S T V W
All Classes and Interfaces|All Packages

A

add(int, T) - Method in class HashSet: This method is unsupported, except for the case when index == 0 || index == size
add(T) - Method in class HashSet: Inserts the specified element into the queue represented by this HashSet if it is possible to do so (ie, if this item isn't already contained in the set), returning true upon success.
addAll(int, Collection<? extends T>) - Method in class HashSet: Unsupported method.
addAll(Collection<? extends T>) - Method in class HashSet: Adds all of the elements in the specified collection at the end of this HashSet, as if by calling addLast(T) on each one, in the order that they are returned by the collection's iterator.
addEdge(int, int) - Method in class Graph: Adds an edge with the specified endpoints and data to the graph.
addEdge(int, int, boolean) - Method in class Graph: Adds an edge with the specified endpoints to the graph.
addEdge(int, int, boolean, E) - Method in class Graph: Adds an edge with the specified endpoints and data to the graph.
addEdge(int, int, double) - Method in class Graph: Adds a weighted edge with the specified endpoints and weight to the graph.
addEdge(int, int, double, boolean) - Method in class Graph: Adds a weighted edge with the specified endpoints and weight to the graph.
addEdge(int, int, double, boolean, E) - Method in class Graph: Adds a weighted edge with the specified endpoints, weight and data to the graph.
addEdge(int, int, double, E) - Method in class Graph: Adds a weighted edge with the specified endpoints, weight and data to the graph.
addEdge(int, int, E) - Method in class Graph: Adds an undirected edge with the specified endpoints and data to the graph.
addEdge(Graph.Edge<V, E>) - Method in class Graph: Adds the specified edge to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>) - Method in class Graph: Adds an undirected edge with the specified endpoints to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, boolean) - Method in class Graph: Adds an edge with the specified endpoints to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, boolean, E) - Method in class Graph: Adds an edge with the specified endpoints and data to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double) - Method in class Graph: Adds a weighted edge with the specified endpoints, weight and data to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, boolean) - Method in class Graph: Adds a weighted edge with the specified endpoints and weight to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, boolean, E) - Method in class Graph: Adds a weighted edge with the specified endpoints, weight and data to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, E) - Method in class Graph: Adds a weighted edge with the specified endpoints, weight and data to the graph.
addEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, E) - Method in class Graph: Adds an undirected edge with the specified endpoints and data to the graph.
addFirst(T) - Method in class HashSet: Inserts the specified element at the front of this HashSet if it is possible to do so (ie, if the item is not already contained in this HashSet).
addLast(T) - Method in class HashSet: Inserts the specified element at the end of this HashSet if it is possible to do so (ie, if the item is not already contained in this HashSet).
addVertex() - Method in class Graph: Creates a new data-less vertex, adds it to this graph, then returns it.
addVertex(V) - Method in class Graph: Creates, add to the graph, and returns a new vertex with the specified data.
adjacencyMatrix() - Method in class Graph: Returns the adjacency matrix of this graph.
allHamCycles(Graph<V, E>, Graph.Vertex<V, E>) - Method in class GraphAlgorithms

C

clear() - Method in class HashSet: Removes all of the elements from this collection.
clone() - Method in class HashSet: Creates and returns a shallow copy of this object.
contains(Object) - Method in class HashSet: Returns true if this HashSet contains the specified element.
containsAll(Collection<?>) - Method in class HashSet: Returns true if this collection contains all of the elements in the specified collection.

D

data - Variable in class Graph.Edge: The data associated with this Edge.
data - Variable in class Graph.Vertex: The data associated with this vertex.
descendingIterator() - Method in class HashSet: Returns an iterator over the elements in this HashSet in reverse sequential order.

E

Edge(Graph.Vertex<V, E>, Graph.Vertex<V, E>) - Constructor for class Graph.Edge: Constructs an edge with the specified endpoints.
Edge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, boolean) - Constructor for class Graph.Edge: Constructs an edge with the specified endpoints.
Edge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, boolean, E) - Constructor for class Graph.Edge: Constructs an edge with the specified endpoints holding the specified data.
Edge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, E) - Constructor for class Graph.Edge: Constructs an edge with the specified endpoints holding the specified data.
edgesIn() - Method in class Graph.Vertex: Returns the collection of edges entering this vertex.
edgesOut() - Method in class Graph.Vertex: Returns the collection of edges leaving this vertex.
element() - Method in class HashSet: Equivalent to getFirst().
equals(Object) - Method in class Graph.Edge: Returns true if the specified object is an edge with the same endpoints and in the same direction (if applicable) as this edge.

G

get(int) - Method in class HashSet: Returns the element at the specified position in this list.
get(T) - Method in class HashSet: Returns the item in this HashSet that is equal to the specified item, or null if no such item exists
getEdge(int, int) - Method in class Graph: Returns the edge between the vertices returned by getVertex(i) and getVertex(j), or null if no such edge exists.
getEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>) - Method in class Graph: Returns the edge between the vertices u and v, or null if no such edge exists.
getEdgeFrom(Graph.Vertex<V, E>) - Method in class Graph.Vertex: Returns the edge from the vertex specified by other to this vertex.
getEdges() - Method in class Graph: Returns the collection of edges that backs this Graph.
getEdgeTo(Graph.Vertex<V, E>) - Method in class Graph.Vertex: Returns the edge from this vertex to the vertex specified by other.
getFirst() - Method in class HashSet: Retrieves, but does not remove, the first element of this HashSet.
getLast() - Method in class HashSet: Retrieves, but does not remove, the last element of this HashSet.
getVertex(int) - Method in class Graph: Returns the vertex created at the specified index (so getVertex(0) is the first vertex created, getVertex(1) is the second, etc.).
getVertices() - Method in class Graph: Returns the collection of vertices that backs this Graph.
Graph<V,E> - Class in Unnamed Package: A graph implementation that allows for vertices and edges to hold distinct data entries of different types.
Graph() - Constructor for class Graph: Creates an empty graph.
Graph(int) - Constructor for class Graph: Creates a graph with n (data-less) vertices and no edges.
Graph(Collection<? extends Graph.Edge<V, E>>) - Constructor for class Graph: Uses the specified edges to create a graph.
Graph.Edge<V,E> - Class in Unnamed Package: A holder class for Edges that allows each Edge to track the Vertex endpoints as well as the associated data of the edge.
Graph.Vertex<V,E> - Class in Unnamed Package: A holder class for Vertices that allows each Vertex to track all incident edges and adjacent vertices, as well as store a data entry associated with the vertex.
Graph.WeightedEdge<V,E> - Class in Unnamed Package: An extension of the Edge class that also tracks a double for the associated weight of the edge.
GraphAlgorithms - Class in Unnamed Package
GraphAlgorithms() - Constructor for class GraphAlgorithms

H

hashCode() - Method in class Graph.Edge
HashSet<T> - Class in Unnamed Package: Resizable implementation of the Deque and List interface via a standard HashSet implementation.
HashSet() - Constructor for class HashSet: Creates an empty HashSet.

I

indexOf(Object) - Method in class HashSet: Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
isDirected() - Method in class Graph.Edge: Returns whether this edge is directed.
isEmpty() - Method in class HashSet: Returns true if this collection contains no elements.
iterator() - Method in class HashSet: Returns an iterator over this HashSet in the proper sequence.

L

lastIndexOf(Object) - Method in class HashSet: Equivalent to indexOf(java.lang.Object).
listIterator() - Method in class HashSet: Returns a list iterator over the elements in this list (in proper sequence).
listIterator(int) - Method in class HashSet: Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list.

M

main(String[]) - Static method in class GraphAlgorithms

N

neighborsIn() - Method in class Graph.Vertex: Returns the collection of vertices who can reach this vertex by a single edge.
neighborsOut() - Method in class Graph.Vertex: Returns the collection of vertices reachable from this vertex by a single edge.

O

offer(T) - Method in class HashSet: Equivalent to add(Object).
offerFirst(T) - Method in class HashSet: Inserts the specified element at the front of this HashSet if it is possible to do so (ie, if the item is not already contained in this HashSet).
offerLast(T) - Method in class HashSet: Equivalent to add(Object).
other(Graph.Vertex<V, E>) - Method in class Graph.Edge: Returns the other endpoint of this edge contrasting the specified vertex, or null if the specified vertex is not an endpoint of this edge.

P

peek() - Method in class HashSet: Equivalent to getFirst().
peekFirst() - Method in class HashSet: Equivalent to getFirst().
peekLast() - Method in class HashSet: Equivalent to getLast().
poll() - Method in class HashSet: Equivalent to removeFirst().
pollFirst() - Method in class HashSet: Equivalent to removeFirst().
pollLast() - Method in class HashSet: Equivalent to removeLast().
pop() - Method in class HashSet: Equivalent to removeFirst().
push(T) - Method in class HashSet: Equivalent to addFirst(T).

R

readData(String) - Static method in class GraphAlgorithms
remove() - Method in class HashSet: Equivalent to removeFirst().
remove(int) - Method in class HashSet: Removes the element at the specified position in this list.
remove(Object) - Method in class HashSet: Removes the specified element from this HashSet.
removeAll(Collection<?>) - Method in class HashSet: Removes all of this collection's elements that are also contained in the specified collection.
removeFirst() - Method in class HashSet: Retrieves and removes the first element of this HashSet.
removeFirstOccurrence(Object) - Method in class HashSet: Equivalent to remove(Object)
removeLast() - Method in class HashSet: Retrieves and removes the last element of this HashSet.
removeLastOccurrence(Object) - Method in class HashSet: Equivalent to remove(Object)
retainAll(Collection<?>) - Method in class HashSet: Retains only the elements in this collection that are contained in the specified collection.
reverse() - Method in class Graph.Edge: Returns an edge that is the reverse of this edge.
reverse() - Method in class Graph: Returns a shallow copy of this graph where all edges have been reversed.
reverse() - Method in class Graph.WeightedEdge

S

set(int, T) - Method in class HashSet: Unsupported method.
shortestPaths(Graph<V, E>, Graph.Vertex<V, E>) - Static method in class GraphAlgorithms
size - Variable in class HashSet: The number of items in this HashSet
size() - Method in class HashSet: Returns the number of items in this HashSet.
source() - Method in class Graph.Edge: Returns the source of this directed edge.
subList(int, int) - Method in class HashSet: Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive.

T

target() - Method in class Graph.Edge: Returns the target of this directed edge.
toArray() - Method in class HashSet: Returns an array containing all of the elements in this collection in the correct order.
toArray(A[]) - Method in class HashSet: Returns an array containing all of the elements in this collection in the correct order; the runtime type of the returned array is that of the specified array.
toString() - Method in class Graph.Edge
toString() - Method in class Graph
toString() - Method in class Graph.Vertex
toString() - Method in class Graph.WeightedEdge
toString() - Method in class HashSet: Returns a string representation of the object.

V

Vertex() - Constructor for class Graph.Vertex: Constructs a vertex without any data.
Vertex(V) - Constructor for class Graph.Vertex: Constructs a vertex with the specified data.
vertices() - Method in class Graph.Edge: Returns a list containing the vertices in this edge.

W

WeightedEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double) - Constructor for class Graph.WeightedEdge: Created a weighted edge with the given endpoints and weight.
WeightedEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, boolean) - Constructor for class Graph.WeightedEdge: Creates a weighted edge with the associated end points and data.
WeightedEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, boolean, E) - Constructor for class Graph.WeightedEdge: Creates a weighted edge with the associated endpoints, weight, and data.
WeightedEdge(Graph.Vertex<V, E>, Graph.Vertex<V, E>, double, E) - Constructor for class Graph.WeightedEdge: Creates a weighted edge with the specified endpoints, weight, and data.

A C D E G H I L M N O P R S T V W
All Classes and Interfaces|All Packages