A C G H I M N S U W

A

addEdge(int, int) - Method in class CarlUnweightedGraph

Adds an edge between two vertices.

addEdge(int, int, double) - Method in class CarlWeightedGraph

Adds a weighted edge between two vertices.

addEdge(int, int) - Method in interface UnweightedGraph

Adds an unweighted edge between two vertices.

addEdge(int, int, double) - Method in interface WeightedGraph

Adds a weighted edge between two vertices.

addVertex() - Method in class CarlUnweightedGraph

Adds a new vertex.

addVertex() - Method in class CarlWeightedGraph

Adds a new vertex.

addVertex() - Method in interface Graph

Adds a new vertex.

C

CarlUnweightedGraph - Class in <Unnamed>

An implementation of the Unweighted Graph ADT.

CarlUnweightedGraph() - Constructor for class CarlUnweightedGraph

Default constructor: an empty directed graph.

CarlUnweightedGraph(boolean) - Constructor for class CarlUnweightedGraph

Constructs an empty graph with the specified directedness.

CarlUnweightedGraph(boolean, int) - Constructor for class CarlUnweightedGraph

Constructs a graph with N vertices and the specified directedness.

CarlWeightedGraph - Class in <Unnamed>

An implementation of the Weighted Graph ADT.

CarlWeightedGraph() - Constructor for class CarlWeightedGraph

Default constructor: an empty directed graph.

CarlWeightedGraph(boolean) - Constructor for class CarlWeightedGraph

Constructs an empty graph with the specified directedness, with a sentinel value of Double.POSITIVE_INFINITY.

CarlWeightedGraph(boolean, int) - Constructor for class CarlWeightedGraph

Constructs a graph with N vertices and the specified directedness, with a sentinel value of Double.POSITIVE_INFINITY.

CarlWeightedGraph(boolean, int, double) - Constructor for class CarlWeightedGraph

Constructs a graph with N vertices and the specified directedness and sentinel value.

clear() - Method in class CarlUnweightedGraph

Removes all vertices and edges from the graph.

clear() - Method in class CarlWeightedGraph

Removes all vertices and edges from the graph.

clear() - Method in interface Graph

Removes all vertices and edges from the graph.

G

getDegree(int) - Method in class CarlUnweightedGraph

Returns the out-degree of the specified vertex.

getDegree(int) - Method in class CarlWeightedGraph

Returns the out-degree of the specified vertex.

getDegree(int) - Method in interface Graph

Returns the out-degree of the specified vertex.

getInDegree(int) - Method in class CarlUnweightedGraph

Returns the in-degree of the specified vertex.

getInDegree(int) - Method in class CarlWeightedGraph

Returns the in-degree of the specified vertex.

getInDegree(int) - Method in interface Graph

Returns the in-degree of the specified vertex.

getNeighbors(int) - Method in class CarlUnweightedGraph

Returns an iterator over the neighbors of the specified vertex.

getNeighbors(int) - Method in class CarlWeightedGraph

Returns an iterator over the neighbors of the specified vertex.

getNeighbors(int) - Method in interface Graph

Returns an iterable object that allows iteration over the neighbors of the specified vertex.

getWeight(int, int) - Method in class CarlWeightedGraph

Gets the weight of the edge between two vertices.

getWeight(int, int) - Method in interface WeightedGraph

Gets the weight of the edge between two vertices.

Graph - Interface in <Unnamed>

A common interface for the Graph ADT, encompassing graphs both unweighted and weighted, undirected and directed.

H

hasEdge(int, int) - Method in class CarlUnweightedGraph

Checks whether an edge exists between two vertices.

hasEdge(int, int) - Method in class CarlWeightedGraph

Checks whether an edge exists between two vertices.

hasEdge(int, int) - Method in interface Graph

Checks whether an edge exists between two vertices.

I

isDirected() - Method in class CarlUnweightedGraph

Returns true if the graph is directed.

isDirected() - Method in class CarlWeightedGraph

Returns true if the graph is directed.

isDirected() - Method in interface Graph

Returns true if the graph is directed.

isEmpty() - Method in class CarlUnweightedGraph

Returns true if there are no vertices in the graph.

isEmpty() - Method in class CarlWeightedGraph

Returns true if there are no vertices in the graph.

isEmpty() - Method in interface Graph

Returns true if there are no vertices in the graph.

M

missingEdgeSentinel() - Method in class CarlWeightedGraph

Returns the "sentinel" weight value for edges not in the graph.

missingEdgeSentinel() - Method in interface WeightedGraph

Returns the "sentinel" weight value for edges not in the graph.

N

numEdges() - Method in class CarlUnweightedGraph

Returns the number of edges in the graph.

numEdges() - Method in class CarlWeightedGraph

Returns the number of edges in the graph.

numEdges() - Method in interface Graph

Returns the number of edges in the graph.

numVerts() - Method in class CarlUnweightedGraph

Returns the number of vertices in the graph.

numVerts() - Method in class CarlWeightedGraph

Returns the number of vertices in the graph.

numVerts() - Method in interface Graph

Returns the number of vertices in the graph.

S

setWeight(int, int, double) - Method in class CarlWeightedGraph

Sets the weight of an edge already in the graph.

setWeight(int, int, double) - Method in interface WeightedGraph

Sets the weight of an edge already in the graph.

U

UnweightedGraph - Interface in <Unnamed>

An interface for unweighted graphs.

W

WeightedGraph - Interface in <Unnamed>

An interface for weighted graphs.

A C G H I M N S U W