|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
Shape for a specified edge.Graph interface.g.
Layout.EdgeType.o into this collection.
ChangeListener.
ChangeListener.
l as a listeners to changes in the model.
ChangeListener.
edge to this graph with the specified endpoints,
with the default edge type.
edge to this graph with the specified endpoints
and EdgeType.
e to this graph such that it connects
vertex v1 to v2.
e to this graph such that it connects
vertex v1 to v2.
edge to this graph.
edge to this graph with type edge_type.
child vertex and edge e to the graph
with the specified parent vertex parent.
hyperedge to this graph and connects them to the vertex collection to_attach.
source to destination.
l as a listener to this graph.
subTree to tree by attaching it as a child
of node with edge connectingEdge.
tree to this graph as an element of this forest.
vertex to this graph.
v.
Layout implementation that combines
multiple other layouts so that they may be manipulated
as one layout.delegate.
v in graph,
calculates the average shortest path length from v
to all other vertices in graph using the metric
specified by d, and returns the results in a
Map from vertices to Double values.
v in g,
calculates the average shortest path length from v
to all other vertices in g, ignoring edge weights.
Layout implementation that assigns positions to Tree or
Forest vertices using associations with nested circles ("balloons").Map.Entry.point to polar coordinates.
(x, y) to polar coordinates.
ChangeEvent is needed
instance since the
event's only state is the source property.
IllegalArgumentException if the two arrays are not of the same length.
Layout implementation that positions vertices equally spaced on a regular circle.PickSupport implementation that emulates the picking behavior
of versions of VisualizationViewer prior to version 1.6.GraphElementAccessor that finds the closest element to
the pick point, and returns it if it is within the element's shape.ShapePickSupport for the vv
VisualizationServer, with the specified pick footprint.
ShapePickSupport with the vv
VisualizationServer and default pick footprint.
g into
num_clusters clusters, based on their connectivity.
Collection of clusters, where each cluster is
represented as a Map of Objects to locations
in d-dimensional space.
getCommunity and cluster.
Map of vertices to their clustering coefficients.
Map that returns the constructor-supplied
value for any input.get method always returns value.
edge.
vertex.
BidiMap mapping each element of the collection to its
index as encountered while iterating over the collection.
BidiMap mapping each element of the collection to its
index as encountered while iterating over the collection.
graph associated with each
element of vertex_collections.
vertex_count - 1 vertices
plus one isolated vertex.
graph whose vertex set
is equal to vertices.
Layout suitable for tree-like directed
acyclic graphs.vertex.
Forest that delegates to a specified DirectedGraph
instance.DirectedSparseGraph instance.
DirectedGraph i
Transformer that delegates its operation to a
Transformer.Tree that delegates to
a specified instance of DirectedGraph.DelegateTree which delegates to graph.
g using the metric
specified by d.
g using the metric
specified by d.
g, ignoring edge weights.
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally if and only if
cached is true.
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally.
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally if and only if
cached is true.
DijkstraShortestPath for
the specified graph and the specified method of extracting weights
from edges, which caches results locally.
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
DijkstraShortestPath for
the specified unweighted graph (that is, all weights 1) which
caches results locally.
Graph
that accept only directed edges.DirectedGraph, suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time.DirectedGraph suitable for sparse graphs.DirectedGraph, suitable for sparse graphs,
that permits parallel edges.this(graph, distance, averaging, true, true).
this(graph, edge_weights, averaging, true, true).
this(graph, averaging, true, true).
true if the vertex positions are no longer being
updated.
max_iterations
or if the maximum value change observed is less than tolerance.
e, whose endpoints are at (x1,y1)
and (x2,y2), on the graphics context g.
e, whose endpoints are at (x1,y1)
and (x2,y2), on the graphics context g.
Comparator used in ordering edges.
Predicate.Predicate.
getFilteredEdges().
Shape for a specified edge.v divided by the number of
alters in v's network.
DijkstraShortestPath
should cache its results (final and partial) for future reference.
Graph
as a Graph.bicomponents, all the biconnected
components that are reachable from v.
v.
v.
Graph which is an edge-folded version of h, where
hyperedges are replaced by k-cliques in the output graph.
Graph which is an edge-folded version of h, where
hyperedges are replaced by k-cliques in the output graph.
Graph which is a vertex-folded version of h, whose
vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges
in the input.
Graph which is a vertex-folded version of h, whose
vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges
in the input.
g into a unipartite graph whose vertex set is the
vertices of g's partition p.
g into a unipartite graph whose vertices are the
vertices of g's partition p, and whose edges
consist of collections of the intermediate vertices from other partitions.
d for the specified graph.
d for the specified graph.
generateMixedRandomGraph(edge_weight, num_vertices, true).
v's parent, or the
center of this layout's area if it's a root.
ChangeListeners added
with addChangeListener().
ChangeListeners added
with addChangeListener().
ChangeListeners added
with addChangeListener().
ChangeListeners added
with addChangeListener().
ChangeListeners added
with addChangeListener().
vertex at position index
in this tree, or null if it has no child at that position.
vertex has in this tree.
index.
vertex to its children
in this tree.
v.
vertex in this tree.
i is found.
c1.
c2.
v.
g.
vertex
from the root of this tree.
directed_edge is a directed edge in this graph, returns the destination;
otherwise returns null.
directed_edge is a directed edge in this graph, returns the destination;
otherwise returns null.
source vertex
to the target vertex.
Map from each element t of targets to the
shortest-path distance from source to t.
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.
(x,y).
edge_type matches
the edge type for this graph, and 0 otherwise.
edge_type in this graph.
edgeType matches the
edge type for this graph, and an empty set otherwise.
edge_type.
v that should be tested.
null if e is not
in this graph.
edge in this graph.
e in the context of its (incident) vertex v.
Ellipse2D whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex.
edge as a Pair.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory which creates instances of this class.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
Factory that creates an instance of this graph type.
roots.size() to each
element of roots.
Map.
edge.
vertex.
edge.
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.
Map which maps each vertex
in the graph (including the source vertex)
to the last edge on the shortest path from the
source vertex.
e in graph.
e's index in graph.
Collection view of the incoming edges incident to vertex
in this graph.
Collection view of the incoming edges incident to vertex
in this graph.
ItemListeners added
to this JComboBox with addItemListener().
Layout instance to its center point.
vertex
(that is, the number of vertices that are incident to edges in vertex's
incident edge set).
vertex
via any edges in this graph.
edge from vertex.
Collection view of the outgoing edges incident to vertex
in this graph.
Collection view of the outgoing edges incident to vertex
in this graph.
vertex in this tree.
vertex to its parent in
this tree.
Predicate instances which define this graph's partitions.
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.
vertex has in this graph.
Collection view of the predecessors of vertex
in this graph.
Collection view of the predecessors of vertex
in this graph.
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.
Collection.
RoundRectangle2D whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex.
i is found.
directed_edge is a directed edge in this graph, returns the source;
otherwise returns null.
directed_edge is a directed edge in this graph, returns the source;
otherwise returns null.
tree which is rooted at root as a Forest.
vertex has in this graph.
Collection view of the successors of vertex
in this graph.
Collection view of the successors of vertex
in this graph.
Tree instances.
roots.size() to each of the elements of roots.
i mod row_count, j mod col_count).
ith vertex (counting row-wise).
(x,y).
Vertex which is associated with the
location (x,y).
v.
rectangle relative
to layout.
partition predicate.
Shape.
GradientPaint instances which can be used
to paint an Edge.V
set and a set of edges of type E.Graph that delegates its method calls to a
constructor-specified Graph instance.delegate.
source graph and Type
(vertex/edge addition/removal).
GraphMLReader instance with the specified
vertex and edge factories.
GraphMLReader instance that assigns the vertex
and edge id strings to be the vertex and edge objects,
as well as their IDs.
GraphDecorator.g, as specified by nev.
GraphZoomScrollPane.subtree with the subtree of tree
which is rooted at root.
true if edge_type matches the default edge type for
this graph, and false otherwise.
delegate.
V
and a set of hyperedges of type E which connect the vertices.v with missing (null) distances,
v's score should ignore the missing values or be set to 'null'.
v to itself).
vertex.
vertex.
graphml rather than graph.
true if vertex is the destination of edge.
true if this edge and its endpoints
in this graph are all included in the collections of
elements to be rendered, and false otherwise.
true if this collection contains no elements, and
false otherwise.
true if vertex and edge
are incident to each other.
true if v is neither
a leaf nor the root of this tree.
v has no child nodes.
true if the passed node has no
children.
true if vertex is a leaf of this tree,
i.e., if it has no children.
true if the position of vertex v
is locked.
true if the position of vertex v
is locked.
true if v1 and v2 share an incident edge.
ISOMLayout instance for the specified graph g.
true if v is currently "picked".
true if v1 is a predecessor of v2 in this graph.
v1 is the parent of v2.
true if this ranker ranks edges, and
false otherwise.
true if this ranker ranks nodes, and
false otherwise.
v has no parent node.
true if vertex is a leaf of this tree,
i.e., if it has no children.
true if vertex is the source of edge.
true if v1 is a successor of v2 in this graph.
true if this vertex in this graph is included
in the collections of elements to be rendered, and false otherwise.
Iterator that does not support modification
of the heap.
PageRankWithPriors that computes the importance of a node based upon taking fixed-length random
walks out from the root set and then computing the stationary probability of being at each node.PageRankWithPriors in which the final scores
represent a probability distribution over position assuming a random (Markovian)
walk of exactly k steps, based on the initial distribution specified by the priors.latticeSize
with the specified parameters.
row_count x col_count lattices
with the specified parameters.
HyperbolicTransform
and MagnifyTransform
applied to either the model (graph layout) or the view
(VisualizationViewer)
The hyperbolic transform is applied in an elliptical lens
that affects that part of the visualization.g with the graph represented by the
Pajek-format data supplied by reader.
v from a lack of primary holes
around its neighbor v2.
v in place if state is true, otherwise unlocks it.
lock is true, otherwise unlocks all vertices.
delegate.
update() and contains operations.MapBinaryHeap whose heap ordering
is based on the ordering of the elements specified by c.
MapBinaryHeap whose heap ordering
will be based on the natural ordering of the elements,
which must be Comparable.
MapBinaryHeap based on the specified
collection whose heap ordering
will be based on the natural ordering of the elements,
which must be Comparable.
MapBinaryHeap based on the specified collection
whose heap ordering
is based on the ordering of the elements specified by c.
SettableTransformer that operates on an underlying Map instance.m.
Collection of
distributions, which are assumed to be normalized arrays of
double values.
double values.
BarabasiAlbertGenerator.v1 to v2
plus the weight of the edge from v2 to v1;
if either edge does not exist, it is treated as an edge with weight 0.
Map provided in the input.
double
array, so that the values sum to 1 (i.e., can be treated as probabilities).
v1's network time and energy invested
in the relationship with v2.
Number-generating Transformer with an internal
NumberFormat instance.delegate.
Tree in which each vertex has
<= k children.Graph that orders its vertex and edge collections
according to insertion time, is suitable for sparse graphs, and
permits directed, undirected, and parallel edges.v.
vertex.
vertex.
v's icon on g at (x,y).
Collection that stores exactly
2 non-null objects and is not mutable.Pair from the specified elements.
Pair from the passed array.
Graph from a Pajek NET formatted source.true if the
argument ends with the string "list".true if the
argument starts with the constructor-specified String.PersistentLayout
and PersistentLayoutImpl.v as "picked" if b == true,
and unmarks v as picked if b == false.
Paint
parameters given in the constructor, so that picked and
non-picked edges can be made to look different.Icon
parameters given in the constructor, so that picked and
non-picked vertices can be made to look different.Paint
parameters given in the constructor, so that picked and
non-picked vertices can be made to look different.Paint
parameters given in the constructor, so that picked and
non-picked vertices can be made to look different.PluggableRenderer.radius and angle theta.
polar to Cartesian coordinates.
(theta, radius) to Cartesian coordinates.
MapBinaryHeap.poll()
or MapBinaryHeap.remove() instead.
layout from this instance.
edge from this tree, and the subtree rooted
at the child vertex incident to edge.
edge from this tree.
edge from this graph.
l as a listener to this graph.
vertex from this tree, and the subtree
rooted at vertex.
vertex from this tree.
vertex from this graph.
source.
source.
edge and its parallel edges in graph.
g to filename.
g to filename.
g to filename; no vertex labels are written out,
and the edge weights are written as 1.0.
g to w; no vertex labels are written out,
and the edge weights are written as 1.0.
g to w; vertex labels are given by
vs and edge weights by nev.
graph to w.
Predicate that returns true if the input edge's
endpoints in the input graph are identical.output) to be returned by a call to
transform(input)).
JComponent.setBackground to assign
the unselected-background color to the specified color.
JComponent.setBackground to assign
the unselected-background color to the specified color.
JComponent.setBackground to assign
the unselected-background color to the specified color.
control_offset_increment.
value.
JComponent.setForeground to assign
the unselected-foreground color to the specified color.
JComponent.setForeground to assign
the unselected-foreground color to the specified color.
JComponent.setForeground to assign
the unselected-foreground color to the specified color.
Hypergraph that is suitable for sparse graphs and
permits parallel edges.SetHypergraph and initializes the internal data structures.
Map.
p.
evaluate will call step.
theta.
Random instance used by this instance.
seed.
size.
transform())
when invoked on a given input.theta.
value.
String object for the cell being rendered to
value.
String object for the cell being rendered to
value.
String object for the cell being rendered to
value.
Comparator to be used in sorting the vertices.
comparator.
vertex_list.
GraphElementAccessor that returns elements whose Shape
contains the specified pick point or region.ShapePickSupport for the vv
VisualizationServer, with the specified pick footprint and
the default pick style.
ShapePickSupport for the specified
VisualizationServer with a default pick footprint.
Style.CENTERED: returns the element whose
center is closest to the pick point.br for which p
returns true, or null if there is no
such line.
Graph that is suitable for sparse graphs,
orders its vertex and edge collections according to either specified Comparator
instances or the natural ordering of their elements, and permits directed, undirected,
and parallel edges.Comparators.
Graph that is suitable for sparse graphs and
permits both directed and undirected edges.Graph that is suitable for sparse graphs
and permits directed, undirected, and parallel edges.g encodes.
StructuralHoles instance based on the
edge weights specified by nev.
KullbackLeibler(dist, reference) + KullbackLeibler(reference, dist).
graph (which may be of any directionality)
into a directed graph.
graph (which may be of any directionality)
into an undirected graph.
Icon associated with v.
Icon, depending on picked state.
Graph which is a (directed, rooted) tree.Tree.Graph that
accept only undirected edges.UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges.UndirectedGraph that is suitable
for sparse graphs.UndirectedGraph that is suitable for
sparse graphs and permits parallel edges.DirectedGraph backed by the passed graph.
Forest backed by the passed forest.
Tree backed by the passed tree.
UndirectedGraph backed by the passed graph.
v.
UIManager that the look and feel
[L&F] has changed.
UIManager that the look and feel
[L&F] has changed.
UIManager that the look and feel
[L&F] has changed.
IllegalArgumentException if edge_type does not
match the default edge type for this graph.
Comparator used in ordering vertices.
Predicate.Predicate.
Shapes for drawing vertices.VertexShapeFactory with the specified
vertex size and aspect ratio functions.
VertexShapeFactory with a constant size of
10 and a constant aspect ratio of 1.
getFilteredVertices().
Graph based on their ranks as
calculated by VoltageScorer.transform.
VisualizationServer in which the
this instance is being used for picking.
this(item_weights, new Random(), DEFAULT_THRESHOLD).
this(item_weights, new Random(), threshold).
this(item_weights, random, DEFAULT_THRESHOLD).
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||