|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |
generateMixedRandomGraph(edge_weight, num_vertices, true)
.
v
which is stored in Map m
.
key
.
Edge
which
this VisEdge
represents.
Color
to use for drawing the interior
of the vertex v
.
ChangeListener
s added
with addChangeListener().
ChangeListener
s added
with addChangeListener().
ChangeListener
s added
with addChangeListener().
ChangeListener
s added
with addChangeListener().
ChangeListener
s added
with addChangeListener().
ChangeListener
s added
with addChangeListener().
source
of the
line defined by source
and target
,
and the bounding box bounds
, or null
if there is no intersection.
c1
.
c2
.
v
.
g
.
g
.
source
vertex
to the target
vertex.
LinkedHashMap
which maps each vertex
in the graph (including the source
vertex)
to its distance from the source
vertex.
LinkedHashMap
which maps each of the closest
numDist
vertices to the source
vertex
in the graph (including the source
vertex)
to its distance from the source
vertex.
Map
which maps each vertex
in the graph (including the source
vertex)
to its distance (represented as a Number)
from source
.
Edge
which is associated with the
location (x,y)
.
Edge
which this VisEdge
represents.
Collection
of requirements that each edge
must satisfy when it is added to this graph.
Set
consisting of all edges e
in graph g
that satisfy predicate p
,
that is, those for which p.evaluate(e)
returns true.
p
.
Ellipse2D
whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex.
g
, if any,
that is equivalent to this edge.
g
which are equal
to the edges in g
.
g
, if any, that is
equal to this vertex.
ag
that is equivalent to this vertex.
g
which are equal
to the vertices in g
.
Color
to use for drawing the border and
text for the vertex v
.
Edge
which
this VisEdge
represents.
getVisualizationViewer().getGraphLayout()
instead.
Icon
associated with v
.
Icon
, depending on picked state.
Map
.
v
that should be tested.
source
to target
, or null if target
is not
reachable from source
.
LinkedHashMap
which maps each vertex
in the graph (including the source
vertex)
to the last edge on the shortest path from the
source
vertex.
LinkedHashMap
which maps each of the closest
numDist
vertices to the source
vertex
in the graph (including the source
vertex)
to the incoming edge along the path from that vertex.
LinkedHashMap
which maps each vertex
in the graph (including the source
vertex)
to the last edge on the shortest path from the
source
vertex.
SubsetManager
, creating it if necessary.
UserDataContainer
instance.
ItemListener
s added
to this JComboBox with addItemListener().
ItemListener
s added
to this JComboBox with addItemListener().
value
.
ArchetypeVertex
.
NumberVertexValue
with uniformly distributed values
such that their sum (of their squares if squared
is
true
) over all vertices in g
is 1.
NumberVertexValue
with uniformly distributed values
such that their sum, over all vertices in g
, is 1.
v
.
EfficientFilter
,
then there is a "previous" graph--and thus a previous GraphAssemblyRecord.
v
.
List
of the edges on the shortest path from
source
to target
, in order of their
occurrence on this path.
List
of the edges on the shortest path from
source
to target
, in order of their
occurrence on this path.
EdgeRanking
, otherwise
if the algorithm is ranking nodes the instances will be of type NodeRanking
Rectangle2D
whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex.
num_sides
-sided
Polygon
whose bounding
box's width and height are defined by this instance's size and
aspect ratio functions for this vertex.
Polygon
of num_points
points whose bounding
box's width and height are defined by this instance's size and
aspect ratio functions for this vertex.
RoundRectangle2D
whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex.
Shape
associated with e
.
(x,y)
.
old_value
and the corresponding value in
new_value
.
Iterator
which can be used to iterate over
all the user data repository keys for this object.
Vertex
which is associated with the
location (x,y)
.
Collection
of constraints that each vertex
must satisfy when it is added to this graph.
VertexGenerator
, if any, stored in g
's
user data at the standardized location specified by the VG interface: VertexGenerator.TAG
.
VertexShapeFunction
currently being
used by this instance.
Set
consisting of all vertices v
in graph g
that satisfy predicate p
,
that is, those for which p.evaluate(v)
returns true.
p
.
PluggableRenderer
method
setEdgeIncludePredicate
.
PluggableRenderer
method
setVertexIncludePredicate
.
GradientPaint
instances which can be used
to paint an Edge
.ArchetypeGraph
which consists of
a Vertex
set and an Edge
set.VisualizationViewer
directly instead.g
, as specified by nev
.
GraphZoomScrollPane
.
|
||||||||||
PREV LETTER NEXT LETTER | FRAMES NO FRAMES |