

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
A Graph G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices (singular: vertex). The set E is called the edge set of G, and its elements are called edges.
Nested Class Summary  
static interface 
Graph.Edge

static interface 
Graph.Path
A path of length k from a vertex u to a vertex u' in a Graph G = (V, E) is a sequence ⟨v_{0}, v_{1}, _{2}, …, v_{k}⟩ of vertices such that u = v_{0}, u' = v_{k}, and (v_{i1}, v_{i}) ∈ E for i = 1, 2, …, k. 
Method Summary  
boolean 
addEdge(java.util.List edge)
Adds this edge to the graph. 
boolean 
addVertex(java.lang.Object vertex)
Adds this vertex to the graph. 
boolean 
areAdjacent(java.lang.Object u,
java.lang.Object v)
If (u, v) is an edge in a Graph G = (V, E), we say that vertex v is adjacent to vertex u. 
boolean 
containsEdge(java.util.List edge)

boolean 
containsVertex(java.lang.Object vertex)

int 
degree(java.lang.Object vertex)
The degree of a vertex in an undirected graph is the number of of edges incident on it. 
java.util.Set 
getEdges()
For a graph G = (V, E), this return E 
java.util.Set 
getVertices()
For a graph G = (V, E), this returns V 
Graph 
induce(java.util.Set v_prime)
Given a set V' ⊆ V, the subgraph of g induced is the graph G' = (V', E'), where: E' = { (u, v) ∈ E : u, v ∈ V' } 
boolean 
isReachable(java.lang.Object u,
java.lang.Object u_prime)
If there is a path p from u to u' we say that u' is reachable from u via p. 
boolean 
isSubgraph(Graph g_prime)
We say that a graph G' = (V', E') is a subgraph of G = (V, E) if V' ⊆ V and E' ⊆ E. 
Method Detail 
public boolean areAdjacent(java.lang.Object u, java.lang.Object v)
u
 A node of the graphv
 A node of the graph
true
If and only if u → vpublic int degree(java.lang.Object vertex)
vertex
 The vertex to determine the degree of
public boolean isSubgraph(Graph g_prime)
g_prime
 The graph you are checking whether or not it is a
subgraph of this graph
true
if g_prime is a subgraph of this graphpublic Graph induce(java.util.Set v_prime)
v_prime
 The subset of vertices with which to induce a subgraph
out of
public boolean addVertex(java.lang.Object vertex)
vertex
 The vertex to add to this graph
true
if this vertex was not already in the graphpublic boolean addEdge(java.util.List edge)
edge
 The edge to add. This must be a tuple with order 2
true
if this edge did not exist in the graphpublic java.util.Set getVertices()
public java.util.Set getEdges()
public boolean isReachable(java.lang.Object u, java.lang.Object u_prime)
public boolean containsVertex(java.lang.Object vertex)
public boolean containsEdge(java.util.List edge)


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 