A B C D E G H I N O P R S

A

addEdge(E, Graph<V, E>.Node, Graph<V, E>.Node) - Method in class Graph

Adds an edge

addEdgeRef(Graph<V, E>.Edge) - Method in class Graph.Node

Adds an edge to the edge list

addNode(V) - Method in class Graph

Adds a node

B

BFT(Graph<V, E>.Node) - Method in class Graph

Breadth-first traversal of graph

C

check() - Method in class Graph

Checks the consistency of the graph

D

DFT(Graph<V, E>.Node) - Method in class Graph

Depth-first traversal of graph -- public interface

distances(Graph<V, E>.Node) - Method in class Graph

Dijkstra's shortest-path algorithm to compute distances to nodes

E

edges - Variable in class Graph

The list of edges

edgeTo(Graph<V, E>.Node) - Method in class Graph.Node

Returns the edge to a specified node, or null if there is none

endpoints(HashSet<Graph<V, E>.Edge>) - Method in class Graph

Returns nodes that are endpoints of a list of edges

equals(Object) - Method in class Graph.Edge

Two edges are equal if they connect the same endpoints regardless of the data they carry.

G

getData() - Method in class Graph.Edge

Accessor for data

getData() - Method in class Graph.Node

Accessor for data

getEdge(int) - Method in class Graph

Accessor for edges

getEdgeRef(Graph<V, E>.Node, Graph<V, E>.Node) - Method in class Graph

Accessor for specific edge

getHead() - Method in class Graph.Edge

Accessor for endpoint #1

getNeighbors() - Method in class Graph.Node

Returns a list of neighbors

getNode(int) - Method in class Graph

Accessor for nodes

getTail() - Method in class Graph.Edge

Accessor for endpoint #2

Graph<V,E> - Class in <Unnamed>

Implements a graph.

Graph() - Constructor for class Graph

Constructor initializes with empty node and edge lists

Graph.Edge - Class in <Unnamed>

Implements an edge in a graph.

Graph.Edge(E, Graph<V, E>.Node, Graph<V, E>.Node) - Constructor for class Graph.Edge

Constructor creates a new edge

Graph.Node - Class in <Unnamed>

Implements a node in a graph.

Graph.Node(V) - Constructor for class Graph.Node

Constructor creates a disconnected node

H

hashCode() - Method in class Graph.Edge

Redefined hashcode to match redefined equals

I

isNeighbor(Graph<V, E>.Node) - Method in class Graph.Node

Returns true if there is an edge to the node in question

N

nodes - Variable in class Graph

The list of vertices

numEdges() - Method in class Graph

Accessor for number of edges

numNodes() - Method in class Graph

Accessor for number of nodes

O

oppositeTo(Graph<V, E>.Node) - Method in class Graph.Edge

Accessor for opposite node

otherNodes(HashSet<Graph<V, E>.Node>) - Method in class Graph

Returns nodes not on a given list

P

print() - Method in class Graph

Prints a representation of the graph

R

removeEdge(Graph<V, E>.Edge) - Method in class Graph

Removes an edge

removeEdge(Graph<V, E>.Node, Graph<V, E>.Node) - Method in class Graph

Removes an edge

removeEdgeRef(Graph<V, E>.Edge) - Method in class Graph.Node

Removes an edge from the edge list

removeNode(Graph<V, E>.Node) - Method in class Graph

Removes a node

S

setData(E) - Method in class Graph.Edge

Manipulator for data

setData(V) - Method in class Graph.Node

Manipulator for data

A B C D E G H I N O P R S