Index
All Classes and Interfaces|All Packages|Constant Field Values
A
- addEdge(String, String) - Method in interface Graph
-
Adds a new edge.
- addEdge(String, String) - Method in class StringGraph
- addEdges(String[][]) - Method in interface Graph
-
Adds multiple edges.
- addEdges(String[][]) - Method in class StringGraph
- addVertex(String) - Method in interface Graph
-
Adds a new vertex to this graph.
- addVertex(String) - Method in class StringGraph
- addVertices(String[]) - Method in interface Graph
-
Adds one or more vertices to this graph.
- addVertices(String[]) - Method in class StringGraph
- averageDegree() - Method in interface Graph
-
Returns the average degree of the graph
- averageDegree() - Method in class StringGraph
B
- bfsOrder(String) - Method in interface Graph
-
Performs a Breadth First Search traversal starting at a given vertex.
- bfsOrder(String) - Method in class StringGraph
- bfsSSSP(String) - Method in interface Graph
-
Perform BFS Single Source Shortest Path from specified vertex.
- bfsSSSP(String) - Method in class StringGraph
- bfsTree(String) - Method in interface Graph
-
Performs a Breadth First Search traversal starting at a given vertex.
- bfsTree(String) - Method in class StringGraph
C
- capacity - Variable in class StringGraph
-
Number of vertices that can be stored in this graph before the size of the labels and adjacency arrays needs to be increased.
- capacity() - Method in interface Graph
-
Returns the number of vertices that can be added to this graph before the array of vertices needs to be increased.
- capacity() - Method in class StringGraph
D
- DEFAULT_CAPACITY - Static variable in interface Graph
-
The default capacity used when the no-argument constructor is called.
- degree(String) - Method in interface Graph
-
Returns the degree of a vertex
- degree(String) - Method in class StringGraph
- degreeSequence() - Method in interface Graph
-
Return the degree sequence for this graph.
- degreeSequence() - Method in class StringGraph
- deleteEdge(String, String) - Method in interface Graph
-
Deletes an edge.
- deleteEdge(String, String) - Method in class StringGraph
- deleteVertex(String) - Method in interface Graph
-
Deletes a vertex and all of its incident edges.
- deleteVertex(String) - Method in class StringGraph
- dfsOrder(String) - Method in interface Graph
-
Performs a Depth First Search traversal starting at a given vertex.
- dfsOrder(String) - Method in class StringGraph
- dfsTree(String) - Method in interface Graph
-
Performs a Depth First Search traversal starting at a given vertex.
- dfsTree(String) - Method in class StringGraph
E
- edgeExists(String, String) - Method in interface Graph
-
Determines if an edge with the given end vertices exists.
- edgeExists(String, String) - Method in class StringGraph
- edgeMatrix - Variable in class StringGraph
-
2D array that stores adjacencies between pairs of vertices.
G
- getEdges() - Method in interface Graph
-
Creates and returns a new 2D array of strings containing the edges of this graph.
- getEdges() - Method in class StringGraph
- getGraphString() - Method in class StringGraph
-
Return a string showing the vertices and edges of this graph.
- getMatrixString() - Method in class StringGraph
-
Returns a string containing the adjacency matrix for this graph.
- getNeighbors(String) - Method in interface Graph
-
Returns the labels of all neighbors of a vertex.
- getNeighbors(String) - Method in class StringGraph
- getVertices() - Method in interface Graph
-
Creates and returns a new array of Strings containing the vertices of this graph.
- getVertices() - Method in class StringGraph
- Graph - Interface in Unnamed Package
-
A graph whose vertices are strings.
I
- isConnected() - Method in interface Graph
-
Determines if the graph is connected.
- isConnected() - Method in class StringGraph
L
- labels - Variable in class StringGraph
-
1D array that stores the vertex labels.
M
- maxDegree() - Method in interface Graph
-
Returns the maximum degree of the graph
- maxDegree() - Method in class StringGraph
- minDegree() - Method in interface Graph
-
Returns the minimum degree of the graph.
- minDegree() - Method in class StringGraph
N
- numberOfEdges() - Method in interface Graph
-
Returns the number of edges in this graph (the "size" of this graph).
- numberOfEdges() - Method in class StringGraph
- numberOfVertices() - Method in interface Graph
-
Returns the number of vertices in this graph (the "order" of this graph).
- numberOfVertices() - Method in class StringGraph
- numEdges - Variable in class StringGraph
-
Number of edges in this graph (the "size" of this graph).
- numVertices - Variable in class StringGraph
-
Number of vertices in this graph (the "order" of this graph).
R
- resize(int) - Method in interface Graph
-
Resizes the array of labels and the adjacency matrix to a new capacity.
- resize(int) - Method in class StringGraph
S
- shortestPath(String, String) - Method in interface Graph
-
Returns the shortest path in this graph from vertex s to vertex t.
- shortestPath(String, String) - Method in class StringGraph
- StringGraph - Class in Unnamed Package
-
Class for Graph Assignment Part 4
- StringGraph() - Constructor for class StringGraph
-
Default constructor sets initial capacity to the value indicated by the constant value Graph.Default_Capacity.
- StringGraph(int) - Constructor for class StringGraph
-
Parameterized constructor sets initial capacity to given capacity
- StringGraph(String[]) - Constructor for class StringGraph
-
Parameterized constructor gives initial set of vertex labels.
- StringGraph(String[], String[][]) - Constructor for class StringGraph
-
Parameterized constructor gives initial set of vertex labels and edges.
T
- toString() - Method in interface Graph
-
Returns a string representation of this Graph.
- toString() - Method in class StringGraph
V
- vertexExists(String) - Method in interface Graph
-
Determines if a vertex with the given label exists.
- vertexExists(String) - Method in class StringGraph
All Classes and Interfaces|All Packages|Constant Field Values