|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |
ArchetypeEdge
that connects exactly
two instances of Vertex
.Shape
for a specified edge.Shape
for a specified edge.EdgeStrokeFunction
instead.EdgeThicknessFunction
into an EdgeStrokeFunction
.RelativeAuthorityRanker
, relative to a specified subset of elements).Predicate
tests whether an Object
satisfies a specific
implementation-defined property.GraphDraw
mechanism: generalized functions so users can tweak variables freely when creating with EdgeDraw.v
divided by the number of
alters in v
's network.
DijkstraShortestPath
should cache its results (final and partial) for future reference.
true
if g
is constrained to only
accept directed edges, and false otherwise.
true
if p
is an edge
constraint of g
, and false
otherwise.
true
if g
is constrained to
reject parallel edges.
true
if g
is constrained to only
accept undirected edges.
true
if p
is an edge
constraint of g
, and false
otherwise.
true
if o
is an instance of
ArchetypeEdge
that is equivalent to this edge.
true
if o
is an instance of
ArchetypeVertex
that is equivalent to this vertex.
true
if this edge is not currently
part of graph ag
.
true
if there exists an
edge which is parallel to the specified edge.
true
if e
is an
Edge
that connects a vertex to itself.
true
if ae
is neither a
self-loop nor parallel to an existing edge.
true
if the datum stored by e
with
key value key
(in the user data repository) is
datum
.
true
if there exists a path from each
vertex to all other vertices (ignoring edge direction).
Map
of each constituent predicate of p
(if any) to the result of evaluating this predicate on o
.
true
if the argument is a Vertex
whose degree is 0.
true
if this vertex is not currently
a member of any graph.
true
if the datum stored by v
with
key value key
(in the user data repository) is
datum
.
|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |