- AbstractGraph<V,E> - Class in <Unnamed>
-
AbstractGraph represents a mostly-complete implementation of the Graph interface.
- AbstractGraph() - Constructor for class AbstractGraph
-
Constructs a new empty undirected, unweighted graph.
- AbstractGraph(boolean, boolean) - Constructor for class AbstractGraph
-
Constructs a new empty graph that can be directed or undirected,
weighted or unweighted.
- addEdge(V, V) - Method in class AbstractGraph
-
Adds an edge between the given two vertices, if none already exists.
- addEdge(V, V, E) - Method in class AbstractGraph
-
Adds an edge between the given two vertices, if none already exists,
storing the given information in the edge.
- addEdge(V, V, int) - Method in class AbstractGraph
-
Adds an edge between the given two vertices, if none already exists.
- addEdge(V, V, E, int) - Method in class AbstractGraph
-
Adds an edge with the given information and weight between the given two vertices,
storing the given information in the edge.
- addEdge(V, V) - Method in interface Graph
-
Adds an edge between the given two vertices, if none already exists.
- addEdge(V, V, E) - Method in interface Graph
-
Adds an edge between the given two vertices, if none already exists,
storing the given information in the edge.
- addEdge(V, V, int) - Method in interface Graph
-
Adds an edge between the given two vertices, if none already exists.
- addEdge(V, V, E, int) - Method in interface Graph
-
Adds an edge with the given information and weight between the given two vertices,
storing the given information in the edge.
- addVertex(V) - Method in class AbstractGraph
-
Adds the given element as a vertex in this graph.
- addVertex(V) - Method in interface Graph
-
Adds the given element as a vertex in this graph.
- checkForNegative(int) - Static method in class AbstractGraph
-
Tests the given integer to see whether it is negative.
- checkForNull(Object...) - Static method in class AbstractGraph
-
Tests the given arguments for null.
- CheckSearchableGraph - Class in <Unnamed>
-
- CheckSearchableGraph() - Constructor for class CheckSearchableGraph
-
- checkVertex(V) - Method in class AbstractGraph
-
Tests the given vertex for null and for membership in the graph.
- checkVertices(V, V) - Method in class AbstractGraph
-
Tests the given vertices for null and for membership in the graph.
- clear() - Method in class AbstractGraph
-
Removes all vertices and edges from this graph.
- clear() - Method in interface Graph
-
Removes all vertices and edges from this graph.
- clear() - Method in class Vertex
-
Resets the previous, visited, cost, and number data fields to their original values.
- clearEdges() - Method in class AbstractGraph
-
Removes all edges from this graph.
- clearEdges() - Method in interface Graph
-
Removes all edges from this graph.
- clearVertexInfo() - Method in class AbstractGraph
-
Resets all distance / previous / visited markings from vertex info
objects in this graph.
- contains(V) - Method in class Edge
-
Returns true if this edge touches the given vertex, that is,
if it is the start or end of this edge.
- containsEdge(E) - Method in class AbstractGraph
-
Returns whether this graph contains at least one edge with the given
information stored in it.
- containsEdge(V, V) - Method in class AbstractGraph
-
Returns whether this graph contains an edge between the given vertices.
- containsEdge(E) - Method in interface Graph
-
Returns whether this graph contains at least one edge with the given
information stored in it.
- containsEdge(V, V) - Method in interface Graph
-
Returns whether this graph contains an edge between the given vertices.
- containsVertex(V) - Method in class AbstractGraph
-
Returns whether this graph contains the given vertex.
- containsVertex(V) - Method in interface Graph
-
Returns whether this graph contains the given vertex.
- cost(List<V>) - Method in class AbstractGraph
-
Returns the total cost of following the given path of vertices in this graph,
which is the sum of the edge weights between the path's vertices from start to end.
- cost(List<V>) - Method in interface Graph
-
Returns the total cost of following the given path of vertices in this graph,
which is the sum of the edge weights between the path's vertices from start to end.
- cost() - Method in class Vertex
-
Returns the value of the internal 'cost' to reach this vertex.
- create() - Static method in class SearchableGraph
-
A Guava-like static factory method that returns a new searchable
undirected, unweighted graph.
- create(boolean) - Static method in class SearchableGraph
-
A Guava-like static factory method that returns a new empty unweighted
searchable graph that can be directed or undirected.
- create(boolean, boolean) - Static method in class SearchableGraph
-
A Guava-like static factory method that returns a new empty searchable graph
that can be directed or undirected, weighted or unweighted.
- edge(V, V) - Method in class AbstractGraph
-
Returns the extra information stored in the edge between vertices v1 and v2, if one exists.
- Edge<V,E> - Class in <Unnamed>
-
An Edge object represents information stored in a graph edge,
including its vertices, weight, and any extra edge info.
- Edge(V, V, E) - Constructor for class Edge
-
Constructs information about the given edge with the default edge weight.
- Edge(V, V, E, int) - Constructor for class Edge
-
Constructs information about the given edge with the given weight.
- edge() - Method in class Edge
-
Returns the extra information, if any, stored in this edge.
- edge(V, V) - Method in interface Graph
-
Returns the extra information stored in the edge between vertices v1 and v2, if one exists.
- edgeCount() - Method in class AbstractGraph
-
Returns the total number of edges in this graph.
- edgeCount() - Method in interface Graph
-
Returns the total number of edges in this graph.
- edges() - Method in class AbstractGraph
-
Returns a collection of information about all unique edges in this graph.
- edges() - Method in interface Graph
-
Returns a collection of all edges in this graph.
- edgeWeight(V, V) - Method in class AbstractGraph
-
Returns the weight of the edge between vertices v1 and v2, if one exists.
- edgeWeight(V, V) - Method in interface Graph
-
Returns the weight of the edge between vertices v1 and v2, if one exists.
- end() - Method in class Edge
-
Returns the ending vertex of this edge.
- equals(Object) - Method in class AbstractGraph
-
Returns true if o refers to a graph with the same vertices, edges, and other properties
(directed vs.
- equals(Object) - Method in class Edge
-
Returns true if o refers to an Edge object with identical state to this Edge object.
- equals(Object) - Method in class Vertex
-
Returns true if o refers to a Vertex object correspending to the same
underlying 'V' object as this one.
- SearchableGraph<V,E> - Class in <Unnamed>
-
A SearchableGraph implements the Graph interface by writing three path-finding
methods: isReachable (DFS), shortestPath (BFS), and minimumWeightPath (Dijkstra's
algorithm).
- SearchableGraph() - Constructor for class SearchableGraph
-
Constructs a new empty undirected, unweighted graph.
- SearchableGraph(boolean, boolean) - Constructor for class SearchableGraph
-
Constructs a new empty graph that can be directed or undirected,
weighted or unweighted.
- setCost(int) - Method in class Vertex
-
Sets the value of the internal 'cost' to reach this vertex.
- setEdge(E) - Method in class Edge
-
Modifies this edge's extra information to be the given value.
- setNumber(int) - Method in class Vertex
-
Sets the value of the internal 'number' vertex marker for this vertex.
- setPrevious(V) - Method in class Vertex
-
Sets the value of the internal 'previous' vertex marker for this vertex.
- setVisited() - Method in class Vertex
-
Sets the value of the internal 'previous' vertex marker to true for this vertex.
- setVisited(boolean) - Method in class Vertex
-
Sets the value of the internal 'previous' vertex marker for this vertex.
- setWeight(int) - Method in class Edge
-
Modifies this edge's weight to be the given value.
- shortestPath(V, V) - Method in interface Graph
-
Returns the path in this graph with the least number of vertices that
leads from the given starting vertex v1 to the given ending vertex v2.
- shortestPath(V, V) - Method in class SearchableGraph
-
Returns the path in this graph with the least number of vertices that
leads from the given starting vertex v1 to the given ending vertex v2.
- start() - Method in class Edge
-
Returns the starting vertex of this edge.
- toString() - Method in class AbstractGraph
-
Returns a string representation of this graph and its vertices and edges, such as
"{V={A, B, C}, E={(A, B), (A, C)}}".
- toString() - Method in class Edge
-
Returns a string representation of the information about this edge.
- toString() - Method in interface Graph
-
Returns a string representation of this graph and its vertices and edges, such as
"{V={A, B, C}, E={(A, B), (A, C)}}".
- toString() - Method in class Vertex
-
Returns a string representation of the information about this vertex.
- toStringDetailed() - Method in class AbstractGraph
-
Returns a detailed multi-line string representation of this graph and its vertices, such as
"Graph{
vertices:
A -> neighbors: [B, C]
B -> neighbors: [A]
C -> neighbors: [A]
edges:
(A,B,weight=2)
(A,C)
}"
- toStringDetailed() - Method in interface Graph
-
Returns a detailed multi-line string representation of this graph and its vertices, such as
"Graph{
vertices:
A -> neighbors: [B, C]
B -> neighbors: [A]
C -> neighbors: [A]
edges:
(A,B,weight=2)
(A,C)
}"