|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
A tagging interface for implementations of Edge
that do not
impose an ordering on their incident vertices.
An undirected edge e
is an unordered pair of
vertices (v1, v2)
which connects
v1
to v2
. Each of v1
and
v2
are considered to be both source and destination of
e
; equivalently, e
is both an outgoing edge
and an incoming edge of each vertex.
UndirectedGraph
,
DirectedEdge
,
Vertex
Nested Class Summary |
Nested classes inherited from class edu.uci.ics.jung.utils.UserDataContainer |
UserDataContainer.CopyAction |
Methods inherited from interface edu.uci.ics.jung.graph.Edge |
getEndpoints, getOpposite |
Methods inherited from interface edu.uci.ics.jung.graph.ArchetypeEdge |
copy, getEqualEdge, getEquivalentEdge, getGraph, getIncidentVertices, isIncident, numVertices |
Methods inherited from interface edu.uci.ics.jung.utils.UserDataContainer |
addUserDatum, containsUserDatumKey, getUserDatum, getUserDatumCopyAction, getUserDatumKeyIterator, importUserData, removeUserDatum, setUserDatum |
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |