A C G H I M N U
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- addEdge(int, int) - Method in class MysteryUnweightedGraphImplementation
-
Adds an edge between two vertices.
- addEdge(int, int) - Method in interface UnweightedGraph
-
Adds an unweighted edge between two vertices.
- addVertex() - Method in interface Graph
-
Adds a new vertex.
- addVertex() - Method in class MysteryUnweightedGraphImplementation
-
Adds a new vertex.
C
- clear() - Method in interface Graph
-
Removes all vertices and edges from the graph.
- clear() - Method in class MysteryUnweightedGraphImplementation
-
Removes all vertices and edges from the graph.
G
- getDegree(int) - Method in interface Graph
-
Returns the out-degree of the specified vertex.
- getDegree(int) - Method in class MysteryUnweightedGraphImplementation
-
Returns the out-degree of the specified vertex.
- getInDegree(int) - Method in interface Graph
-
Returns the in-degree of the specified vertex.
- getInDegree(int) - Method in class MysteryUnweightedGraphImplementation
-
Returns the in-degree of the specified vertex.
- getNeighbors(int) - Method in interface Graph
-
Returns an iterable object that allows iteration over the neighbors of the specified vertex.
- getNeighbors(int) - Method in class MysteryUnweightedGraphImplementation
-
Returns an iterator over the neighbors of the specified vertex.
- 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 interface Graph
-
Checks whether an edge exists between two vertices.
- hasEdge(int, int) - Method in class MysteryUnweightedGraphImplementation
-
Checks whether an edge exists between two vertices.
I
- isDirected() - Method in interface Graph
-
Returns true if the graph is directed.
- isDirected() - Method in class MysteryUnweightedGraphImplementation
-
Returns true if the graph is directed.
- isEmpty() - Method in interface Graph
-
Returns true if there are no vertices in the graph.
- isEmpty() - Method in class MysteryUnweightedGraphImplementation
-
Returns true if there are no vertices in the graph.
M
- MysteryUnweightedGraphImplementation - Class in <Unnamed>
-
An implementation of the Unweighted Graph ADT.
- MysteryUnweightedGraphImplementation() - Constructor for class MysteryUnweightedGraphImplementation
-
Default constructor: an empty directed graph.
- MysteryUnweightedGraphImplementation(boolean) - Constructor for class MysteryUnweightedGraphImplementation
-
Constructs an empty graph with the specified directedness.
- MysteryUnweightedGraphImplementation(boolean, int) - Constructor for class MysteryUnweightedGraphImplementation
-
Constructs a graph with N vertices and the specified directedness.
N
- numEdges() - Method in interface Graph
-
Returns the number of edges in the graph.
- numEdges() - Method in class MysteryUnweightedGraphImplementation
-
Returns the number of edges in the graph.
- numVerts() - Method in interface Graph
-
Returns the number of vertices in the graph.
- numVerts() - Method in class MysteryUnweightedGraphImplementation
-
Returns the number of vertices in the graph.
U
- UnweightedGraph - Interface in <Unnamed>
-
An interface for unweighted graphs.
All Classes All Packages