Java Reference
In-Depth Information
/** Adds a weighted edge between two given distinct vertices that
are currently in the graph. The desired edge must not already
be in the graph. In a directed graph, the edge points toward
the second vertex given.
@param begin an object that labels the origin vertex of the edge
@param end an object, distinct from begin, that labels the end
vertex of the edge
@param edgeWeight the real value of the edge's weight
@return true if the edge is added, or false if not */
public boolean
addEdge(T begin, T end,
double
edgeWeight);
/** Adds an unweighted edge between two given distinct vertices
that are currently in the graph. The desired edge must not
already be in the graph. In a directed graph, the edge points
toward the second vertex given.
@param begin an object that labels the origin vertex of the edge
@param end an object, distinct from begin, that labels the end
vertex of the edge
@return true if the edge is added, or false if not */
public boolean
addEdge(T begin, T end);
/** Sees whether an edge exists between two given vertices.
@param begin an object that labels the origin vertex of the edge
@param end an object that labels the end vertex of the edge
@return true if an edge exists */
public boolean
hasEdge(T begin, T end);
/** Sees whether the graph is empty.
@return true if the graph is empty */
public boolean
isEmpty();
/** Gets the number of vertices in the graph.
@return the number of vertices in the graph */
public int
getNumberOfVertices();
/** Gets the number of edges in the graph.
@return the number of edges in the graph */
public int
getNumberOfEdges();
/** Removes all vertices and edges from the graph. */
public void
clear();
}
// end BasicGraphInterface
