|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||
Edge
interface to minimize the effort required to implement this interface.
from and
to.
Graph
interface to minimize the effort required to implement this interface. Vertex
interface to minimize the effort required to implement this interface.
ArchetypeVertex
set and an ArchetypeEdge set.
GraphUtils.addVertices(edu.uci.ics.jung.graph.Graph, int).
e to this graph, and returns a reference to the
added vertex.
g based on p, which will
be maintained by the g's SubsetManager.
p.
GraphUtils.addVertices(edu.uci.ics.jung.graph.Graph, int).
v to this graph, and returns a reference to the
added vertex.
hv3_x onto this Edge.
g based on p, which will
be maintained by the g's SubsetManager.
p.
count vertices into a graph.
tick
g1 and g2 have equivalent
vertex and edge sets (that is, if each vertex and edge in g1
has an equivalent in g2, and vice versa), and false
otherwise.
|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||