|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Vertex | |
---|---|
edu.uci.ics.jung.algorithms.blockmodel | Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks. |
edu.uci.ics.jung.algorithms.cluster | Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria. |
edu.uci.ics.jung.algorithms.connectivity | Provides a series of methods for computing various aspects of a graph's overall connectivity structure. |
edu.uci.ics.jung.algorithms.flows | Provides a series of methods for solving the s-t max flow and other network flow problems. |
edu.uci.ics.jung.algorithms.importance | Provides a set of algorithms for computing the importance of each node (or edge)
in a graph relative to all others (or, for the algorithms that inherit from
RelativeAuthorityRanker , relative to a specified subset of elements). |
edu.uci.ics.jung.algorithms.metrics | |
edu.uci.ics.jung.algorithms.shortestpath | Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph. |
edu.uci.ics.jung.algorithms.transformation | |
edu.uci.ics.jung.graph | Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes. |
edu.uci.ics.jung.graph.decorators | Provides mechanisms for annotating nodes consistently with useful information. |
edu.uci.ics.jung.graph.filters | Provides for a filtering mechanism that produces subgraphs of an original graph. |
edu.uci.ics.jung.graph.filters.impl | Provides sample implementations and generally useful filters. |
edu.uci.ics.jung.graph.impl | Implementations of the JUNG vertex, edge, and graph interfaces. |
edu.uci.ics.jung.io | Provides a set of graph file format interpreters for loading graphs from disk. |
edu.uci.ics.jung.random.generators | Provides a series of methods for generating new graphs with various properties. |
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application. |
edu.uci.ics.jung.visualization | Provides a visualization mechanism for drawing and rendering Graphs. |
edu.uci.ics.jung.visualization.contrib | These are additional layouts contributed by various users. |
edu.uci.ics.jung.visualization.control | |
edu.uci.ics.jung.visualization.graphdraw | Provides support classes for the GraphDraw mechanism: generalized functions so users can tweak variables freely when creating with EdgeDraw. |
edu.uci.ics.jung.visualization.subLayout | |
edu.uci.ics.jung.visualization.transform.shape | |
samples.graph | Provides sample graph code that may be of interest. |
samples.preview_new_graphdraw | This module provides a new way of thinking about graph drawing. |
samples.preview_new_graphdraw.impl | |
samples.preview_new_graphdraw.iter | |
samples.preview_new_graphdraw.iterablelayouts | |
samples.preview_new_graphdraw.staticlayouts | |
scratch.danyel | |
scratch.danyel.lazy | |
scratch.danyel.sample | |
scratch.danyel.triads | |
scratch.scott | |
test.edu.uci.ics.jung.algorithms.cluster | |
test.edu.uci.ics.jung.algorithms.importance | |
test.edu.uci.ics.jung.graph.impl |
Uses of Vertex in edu.uci.ics.jung.algorithms.blockmodel |
---|
Subinterfaces of Vertex in edu.uci.ics.jung.algorithms.blockmodel | |
---|---|
static interface |
GraphCollapser.CollapsedVertex
This interface represents a vertex that holds a set of objects in some other graph. |
Classes in edu.uci.ics.jung.algorithms.blockmodel that implement Vertex | |
---|---|
class |
BipartiteGraphCollapser.CollapsedBipartiteVertex
|
static class |
GraphCollapser.CollapsedSparseVertex
A CollapsedSparseVertex extends CollapsedVertex. |
Methods in edu.uci.ics.jung.algorithms.blockmodel with parameters of type Vertex | |
---|---|
protected boolean |
StructurallyEquivalent.canpossiblycompare(Vertex v1,
Vertex v2)
This is a space for optimizations. |
protected void |
GraphCollapser.createDirectedEdges(Graph graph,
GraphCollapser.CollapsedVertex superVertex,
Vertex opposite,
Set relevantEdges)
Overridable method to create a up to two directed edges that represents the data in its parameters. |
protected void |
BipartiteGraphCollapser.createUndirectedEdge(Graph g,
GraphCollapser.CollapsedVertex superVertex,
Vertex opposite,
Set relevantEdges)
|
protected void |
GraphCollapser.createUndirectedEdge(Graph g,
GraphCollapser.CollapsedVertex superVertex,
Vertex opposite,
Set relevantEdges)
Overridable method to create a single undirected edge that represents the data in its parameters. |
Set |
EquivalenceRelation.getEquivalenceRelationContaining(Vertex v)
Returns the part of the relation that contains this vertex: it is, of course, a Set If the vertex does not belong to any relation, null is returned. |
protected boolean |
StructurallyEquivalent.isStructurallyEquivalent(Vertex v1,
Vertex v2)
Checks whether a pair of vertices are structurally equivalent. |
protected void |
GraphCollapser.replaceWith(MultiMap m,
Vertex dest,
GraphCollapser.CollapsedVertex superV)
INTERNAL (undocumented) method |
protected boolean |
GraphCollapser.shouldAddEdge(Vertex opposite,
Set rootSet,
Collection edges)
Overridable method checks whether an edge representing the given set of edges should be created. |
Constructors in edu.uci.ics.jung.algorithms.blockmodel with parameters of type Vertex | |
---|---|
GraphCollapser.DirectedCollapsedEdge(Vertex opposite,
Vertex superVertex,
Set relevantEdges)
|
|
GraphCollapser.UndirectedCollapsedEdge(Vertex opposite,
Vertex superVertex,
Set relevantEdges)
|
Uses of Vertex in edu.uci.ics.jung.algorithms.cluster |
---|
Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type Vertex | |
---|---|
protected void |
BicomponentClusterer.findBiconnectedComponents(Vertex v,
ClusterSet bicomponents)
Stores, in bicomponents , all the biconnected
components that are reachable from v . |
protected int |
BicomponentClusterer.get(Vertex v,
Map m)
A convenience method for getting the integer value for v which is stored in Map m . |
protected void |
ExactFlowCommunity.initializeFlowGraph(DirectedGraph flowGraph,
Vertex source,
Vertex sink,
Set rootSet)
Initialize the flow graph |
protected void |
BicomponentClusterer.set(Vertex v,
Map m,
int value)
A convenience method for setting an integer value for v in Map m . |
Uses of Vertex in edu.uci.ics.jung.algorithms.connectivity |
---|
Methods in edu.uci.ics.jung.algorithms.connectivity with parameters of type Vertex | |
---|---|
int |
BFSDistanceLabeler.getDistance(Graph g,
Vertex v)
Given a vertex, returns the shortest distance from any node in the root set to v |
Set |
BFSDistanceLabeler.getPredecessors(Vertex v)
Returns set of predecessors of the given vertex |
void |
BFSDistanceLabeler.labelDistances(Graph graph,
Vertex root)
Computes the distances of all the node from the specified root node. |
Uses of Vertex in edu.uci.ics.jung.algorithms.flows |
---|
Constructors in edu.uci.ics.jung.algorithms.flows with parameters of type Vertex | |
---|---|
EdmondsKarpMaxFlow(DirectedGraph directedGraph,
Vertex source,
Vertex sink,
String edgeCapacityKey,
String edgeFlowKey)
Constructs a new instance of the algorithm solver for a given graph, source, and sink. |
Uses of Vertex in edu.uci.ics.jung.algorithms.importance |
---|
Fields in edu.uci.ics.jung.algorithms.importance declared as Vertex | |
---|---|
Vertex |
NodeRanking.vertex
The vertex being ranked |
Methods in edu.uci.ics.jung.algorithms.importance with parameters of type Vertex | |
---|---|
void |
VoltageRanker.calculateVoltages(Vertex source,
Vertex target)
Calculates an approximation of the solution of the Kirchhoff equations for voltage, given that source supplies 1 V and target
is tied to ground (O V). |
double |
RandomWalkSTBetweenness.computeSTBetweenness(Vertex ithVertex,
Vertex source,
Vertex target)
|
protected void |
WeightedNIPaths.computeWeightedPathsFromSource(Vertex root,
int depth)
|
protected double |
RelativeAuthorityRanker.getPriorRankScore(Vertex v)
Retrieves the value of the prior rank score. |
void |
RelativeAuthorityRanker.setPriorRankScore(Vertex v,
double value)
Allows the user to specify a value to set for the prior rank score |
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type Vertex | |
---|---|
NodeRanking(int originalPos,
double rankScore,
Vertex vertex)
Allows the values to be set on construction. |
|
RandomWalkSTBetweenness(UndirectedGraph g,
Vertex s,
Vertex t)
Constructor which initializes the algorithm |
Uses of Vertex in edu.uci.ics.jung.algorithms.metrics |
---|
Methods in edu.uci.ics.jung.algorithms.metrics with parameters of type Vertex | |
---|---|
double |
StructuralHoles.aggregateConstraint(Vertex v)
The aggregate constraint on v . |
double |
StructuralHoles.constraint(Vertex v)
Burt's constraint measure (equation 2.4, page 55 of Burt, 1992). |
double |
StructuralHoles.effectiveSize(Vertex v)
Burt's measure of the effective size of a vertex's network. |
double |
StructuralHoles.efficiency(Vertex v)
Returns the effective size of v divided by the number of
alters in v 's network. |
double |
StructuralHoles.hierarchy(Vertex v)
Calculates the hierarchy value for a given vertex. |
protected static boolean |
TriadicCensus.link(Vertex a,
Vertex b)
|
double |
StructuralHoles.localConstraint(Vertex v1,
Vertex v2)
Returns the local constraint on v from a lack of primary holes
around its neighbor v2 . |
protected double |
StructuralHoles.maxScaledMutualEdgeWeight(Vertex v1,
Vertex v2)
The marginal strength of v1's relation with contact vertex2. |
protected double |
StructuralHoles.mutualWeight(Vertex v1,
Vertex v2)
Returns the weight of the edge from 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. |
protected double |
StructuralHoles.normalizedMutualEdgeWeight(Vertex v1,
Vertex v2)
Returns the proportion of v1 's network time and energy invested
in the relationship with v2 . |
protected double |
StructuralHoles.organizationalMeasure(Vertex v)
A measure of the organization of individuals within the subgraph centered on v . |
protected static boolean |
TriadicCensus.shouldCount(Indexer id,
Vertex u,
Vertex v,
Vertex w)
Make sure we have a canonical ordering: Returns true if u < w, or v < w < u and v doesn't link to w |
static int |
TriadicCensus.triCode(Vertex u,
Vertex v,
Vertex w)
This is the core of the technique in the paper. |
Uses of Vertex in edu.uci.ics.jung.algorithms.shortestpath |
---|
Methods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Vertex | |
---|---|
Edge |
DijkstraShortestPath.getIncomingEdge(Vertex source,
Vertex target)
Returns the last edge on a shortest path from source
to target , or null if target is not
reachable from source . |
Map |
DijkstraShortestPath.getIncomingEdgeMap(Vertex source)
Returns a LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to the last edge on the shortest path from the
source vertex. |
Map |
ShortestPath.getIncomingEdgeMap(Vertex source)
Returns a LinkedHashMap which maps each vertex
in the graph (including the source vertex)
to the last edge on the shortest path from the
source vertex. |
Map |
UnweightedShortestPath.getIncomingEdgeMap(Vertex source)
|
LinkedHashMap |
DijkstraShortestPath.getIncomingEdgeMap(Vertex source,
int numDests)
Returns a 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. |
static List |
ShortestPathUtils.getPath(ShortestPath sp,
Vertex source,
Vertex target)
Returns a List of the edges on the shortest path from
source to target , in order of their
occurrence on this path. |
List |
DijkstraShortestPath.getPath(Vertex source,
Vertex target)
Returns a List of the edges on the shortest path from
source to target , in order of their
occurrence on this path. |
int |
UnweightedShortestPath.getShortestPath(Vertex source,
Vertex target)
Deprecated. use getDistance |
void |
UnweightedShortestPath.reset(Vertex v)
Clears all stored distances for the specified source vertex source . |
Uses of Vertex in edu.uci.ics.jung.algorithms.transformation |
---|
Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type Vertex | |
---|---|
protected void |
FoldingTransformer.addEdge(Graph newGraph,
Vertex firstEnd,
Element intermediate,
Vertex secondEnd,
NumberEdgeValue nev)
Creates a new edge from firstEnd to secondEnd
in newGraph . |
Uses of Vertex in edu.uci.ics.jung.graph |
---|
Methods in edu.uci.ics.jung.graph that return Vertex | |
---|---|
Vertex |
Graph.addVertex(Vertex v)
Adds v to this graph, and returns a reference to the
added vertex. |
Vertex |
DirectedEdge.getDest()
Returns the destination of this directed edge. |
Vertex |
Edge.getOpposite(Vertex v)
Returns the vertex at the opposite end of this edge from the specified vertex v . |
Vertex |
DirectedEdge.getSource()
Returns the source of this directed edge. |
Methods in edu.uci.ics.jung.graph with parameters of type Vertex | |
---|---|
Vertex |
Graph.addVertex(Vertex v)
Adds v to this graph, and returns a reference to the
added vertex. |
Edge |
Vertex.findEdge(Vertex v)
Returns a directed outgoing edge from this vertex to v ,
or an undirected edge that connects this vertex to v . |
Set |
Vertex.findEdgeSet(Vertex v)
Returns the set of all edges that connect this vertex with the specified vertex v . |
Vertex |
Edge.getOpposite(Vertex v)
Returns the vertex at the opposite end of this edge from the specified vertex v . |
boolean |
Vertex.isPredecessorOf(Vertex v)
Returns true if this vertex is a predecessor of
the specified vertex v , and false otherwise. |
boolean |
Vertex.isSuccessorOf(Vertex v)
Returns true if this vertex is a successor of
the specified vertex v , and false otherwise. |
void |
Graph.removeVertex(Vertex v)
Removes v from this graph. |
Uses of Vertex in edu.uci.ics.jung.graph.decorators |
---|
Methods in edu.uci.ics.jung.graph.decorators that return Vertex | |
---|---|
Vertex |
StringLabeller.getVertex(String label)
Gets the Vertex from the graph associated with this label. |
Vertex |
ToStringLabeller.getVertex(String label)
Always returns null: this impl doesn't keep a table, and so can't meaningfully address this. |
Vertex |
StringLabeller.removeLabel(String string)
|
Vertex |
ToStringLabeller.removeLabel(String string)
This method is not meaningful; it throws an IllegalArgumentException |
Methods in edu.uci.ics.jung.graph.decorators with parameters of type Vertex | |
---|---|
float |
ConstantVertexAspectRatioFunction.getAspectRatio(Vertex v)
|
float |
VertexAspectRatioFunction.getAspectRatio(Vertex v)
|
Color |
ConstantVertexColorFunction.getBackColor(Vertex v)
|
Color |
VertexColorFunction.getBackColor(Vertex v)
Deprecated. Returns the Color to use for drawing the interior
of the vertex v . |
Paint |
ConstantVertexPaintFunction.getDrawPaint(Vertex e)
|
Paint |
PickableVertexPaintFunction.getDrawPaint(Vertex v)
|
Paint |
VertexPaintFunction.getDrawPaint(Vertex v)
|
Paint |
ConstantVertexPaintFunction.getFillPaint(Vertex e)
|
Paint |
PickableVertexPaintFunction.getFillPaint(Vertex v)
|
Paint |
VertexPaintFunction.getFillPaint(Vertex v)
|
Font |
ConstantVertexFontFunction.getFont(Vertex v)
|
Font |
VertexFontFunction.getFont(Vertex v)
|
Color |
ConstantVertexColorFunction.getForeColor(Vertex v)
|
Color |
VertexColorFunction.getForeColor(Vertex v)
Deprecated. Returns the Color to use for drawing the border and
text for the vertex v . |
Shape |
EllipseVertexShapeFunction.getShape(Vertex v)
|
Shape |
VertexIconAndShapeFunction.getShape(Vertex v)
get the shape from the image. |
Shape |
VertexShapeFunction.getShape(Vertex v)
|
int |
ConstantVertexSizeFunction.getSize(Vertex v)
|
int |
InterpolatingVertexSizeFunction.getSize(Vertex v)
|
int |
VertexSizeFunction.getSize(Vertex v)
|
Stroke |
ConstantVertexStrokeFunction.getStroke(Vertex v)
|
Stroke |
VertexStrokeFunction.getStroke(Vertex v)
|
String |
DefaultToolTipFunction.getToolTipText(Vertex v)
|
String |
ToolTipFunction.getToolTipText(Vertex v)
|
String |
ToolTipFunctionAdapter.getToolTipText(Vertex v)
|
void |
GlobalStringLabeller.setLabel(Vertex v,
String l)
Associates a Vertex with a Label, overrwriting any previous labels on this vertex or vertices equal to it. |
void |
StringLabeller.setLabel(Vertex v,
String l)
Associates a Vertex with a Label, overrwriting any previous labels on this vertex. |
void |
ToStringLabeller.setLabel(Vertex v,
String l)
This method always throws an IllegalArgument exception: you cannot externally set the setstring method. |
Uses of Vertex in edu.uci.ics.jung.graph.filters |
---|
Methods in edu.uci.ics.jung.graph.filters with parameters of type Vertex | |
---|---|
abstract boolean |
GeneralVertexAcceptFilter.acceptVertex(Vertex vert)
|
boolean |
TrivialFilter.acceptVertex(Vertex vert)
Returns true for all vertices. |
boolean |
VertexPredicateFilter.acceptVertex(Vertex vert)
|
Uses of Vertex in edu.uci.ics.jung.graph.filters.impl |
---|
Methods in edu.uci.ics.jung.graph.filters.impl with parameters of type Vertex | |
---|---|
boolean |
AlphabeticVertexFilter.acceptVertex(Vertex vert)
Passes the vertex if its StringLabeller value compares over (or under) the threshold. |
boolean |
DropSoloNodesFilter.acceptVertex(Vertex vert)
|
boolean |
NumericDecorationFilter.acceptVertex(Vertex vertex)
|
Constructors in edu.uci.ics.jung.graph.filters.impl with parameters of type Vertex | |
---|---|
KNeighborhoodFilter(Vertex rootNode,
int radiusK,
int edgeType)
Constructs a new instance of the filter |
Uses of Vertex in edu.uci.ics.jung.graph.impl |
---|
Classes in edu.uci.ics.jung.graph.impl that implement Vertex | |
---|---|
class |
AbstractSparseVertex
This class provides a skeletal implementation of the Vertex
interface to minimize the effort required to implement this interface. |
class |
BipartiteVertex
created Dec 28, 2003 |
class |
DirectedSparseVertex
A vertex class that supports directed edges (but not undirected edges) and allows parallel edges. |
class |
LeanSparseVertex
This fully functional class is provided as a different sort of way to think about the creation and use of Vertices, and a reminder that the user is always welcome to create their own vertices. |
class |
SimpleDirectedSparseVertex
An implementation of Vertex that resides in a
directed graph; none of its adjoining edges may be parallel. |
class |
SimpleSparseVertex
An implementation of Vertex that resides in a
sparse graph which may contain both directed and undirected edges. |
class |
SimpleUndirectedSparseVertex
An implementation of Vertex that resides in a
undirected graph; none of its adjoining edges may be parallel. |
class |
SparseVertex
An implementation of Vertex that resides in a
sparse graph which may contain directed and/or undirected edges,
as well as parallel edges. |
class |
UndirectedSparseVertex
A vertex class for instances of UndirectedGraph
that may contain parallel edges. |
Fields in edu.uci.ics.jung.graph.impl declared as Vertex | |
---|---|
protected Vertex |
AbstractSparseEdge.mFrom
One of the two incident vertices of this edge. |
protected Vertex |
SparseTree.mRoot
|
protected Vertex |
AbstractSparseEdge.mTo
One of the two incident vertices of this edge. |
Methods in edu.uci.ics.jung.graph.impl that return Vertex | |
---|---|
Vertex |
AbstractSparseGraph.addVertex(Vertex v)
|
Vertex |
BipartiteGraph.addVertex(Vertex av)
Deprecated. Use addBipartiteVertex |
Vertex |
DirectedSparseEdge.getDest()
|
Vertex |
AbstractSparseEdge.getOpposite(Vertex vertex)
|
Vertex |
SparseTree.getRoot()
|
Vertex |
DirectedSparseEdge.getSource()
|
Methods in edu.uci.ics.jung.graph.impl with parameters of type Vertex | |
---|---|
protected abstract void |
AbstractSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
Adds the specified edge e and vertex v
to the internal data structures of this vertex. |
protected void |
DirectedSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
LeanSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleDirectedSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleUndirectedSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected void |
UndirectedSparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
Vertex |
AbstractSparseGraph.addVertex(Vertex v)
|
Vertex |
BipartiteGraph.addVertex(Vertex av)
Deprecated. Use addBipartiteVertex |
Edge |
AbstractSparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v . |
Edge |
DirectedSparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v , or
null if there is no such edge. |
Edge |
SimpleDirectedSparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v , or
null if there is no such edge. |
Edge |
SimpleSparseVertex.findEdge(Vertex v)
|
Edge |
SimpleUndirectedSparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v , or
null if there is no such edge. |
Edge |
SparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v , or
null if there is no such edge. |
Edge |
UndirectedSparseVertex.findEdge(Vertex v)
Returns the edge that connects this vertex to the specified vertex v , or
null if there is no such edge. |
Set |
AbstractSparseVertex.findEdgeSet(Vertex v)
|
Set |
DirectedSparseVertex.findEdgeSet(Vertex v)
|
Set |
LeanSparseVertex.findEdgeSet(Vertex w)
|
Set |
SimpleDirectedSparseVertex.findEdgeSet(Vertex v)
Returns the set of edges that connect this vertex to the specified vertex. |
Set |
SimpleSparseVertex.findEdgeSet(Vertex v)
|
Set |
SimpleUndirectedSparseVertex.findEdgeSet(Vertex v)
Returns the set of edges that connect this vertex to the specified vertex. |
Set |
SparseVertex.findEdgeSet(Vertex v)
|
Set |
UndirectedSparseVertex.findEdgeSet(Vertex v)
|
Vertex |
AbstractSparseEdge.getOpposite(Vertex vertex)
|
boolean |
LeanSparseVertex.isPredecessorOf(Vertex v)
|
boolean |
SimpleDirectedSparseVertex.isPredecessorOf(Vertex v)
|
boolean |
SimpleSparseVertex.isPredecessorOf(Vertex v)
|
boolean |
SimpleUndirectedSparseVertex.isPredecessorOf(Vertex v)
|
boolean |
LeanSparseVertex.isSuccessorOf(Vertex v)
|
boolean |
SimpleDirectedSparseVertex.isSuccessorOf(Vertex v)
|
boolean |
SimpleSparseVertex.isSuccessorOf(Vertex v)
|
boolean |
SimpleUndirectedSparseVertex.isSuccessorOf(Vertex v)
|
protected abstract void |
AbstractSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
Removes the specified edge e and vertex v
from the internal data structures of this vertex. |
protected void |
DirectedSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
protected void |
LeanSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleDirectedSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
protected void |
SimpleUndirectedSparseVertex.removeNeighbor_internal(Edge connectingEdge,
Vertex neighbor)
Removes the neighbor from this vertex's internal map. |
protected void |
SparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
protected void |
UndirectedSparseVertex.removeNeighbor_internal(Edge e,
Vertex v)
|
void |
AbstractSparseGraph.removeVertex(Vertex v)
Removes all edges adjacent to the specified vertex, removes the vertex, and notifies the vertex that it has been removed. |
void |
BipartiteGraph.removeVertex(Vertex v)
|
Constructors in edu.uci.ics.jung.graph.impl with parameters of type Vertex | |
---|---|
AbstractSparseEdge(Vertex from,
Vertex to)
Creates an edge connecting vertices from and
to . |
|
DirectedSparseEdge(Vertex from,
Vertex to)
Creates a directed edge whose source is from and whose
destination is to . |
|
SparseTree(Vertex root)
|
|
UndirectedSparseEdge(Vertex from,
Vertex to)
Creates an undirected edge that connects vertex from
to vertex to (and vice versa). |
Uses of Vertex in edu.uci.ics.jung.io |
---|
Methods in edu.uci.ics.jung.io with parameters of type Vertex | |
---|---|
protected Edge |
PajekNetReader.createAddEdge(StringTokenizer st,
Vertex v1,
boolean directed,
Graph g,
Indexer id,
boolean parallel_ok)
|
static Predicate |
BipartiteGraphReader.getPartition(Vertex v)
|
Uses of Vertex in edu.uci.ics.jung.random.generators |
---|
Methods in edu.uci.ics.jung.random.generators that return Vertex | |
---|---|
protected Vertex |
SimpleRandomGenerator.newVertex()
|
Methods in edu.uci.ics.jung.random.generators with parameters of type Vertex | |
---|---|
int |
BarabasiAlbertGenerator.getIndex(Vertex v)
|
Uses of Vertex in edu.uci.ics.jung.utils |
---|
Methods in edu.uci.ics.jung.utils that return Vertex | |
---|---|
Vertex |
TypedVertexGenerator.create()
Creates a vertex whose type is determined by the requirements specified in the constructor. |
Vertex |
VertexGenerator.create()
|
Methods in edu.uci.ics.jung.utils with parameters of type Vertex | |
---|---|
static Edge |
GraphUtils.addEdge(Graph g,
Vertex v1,
Vertex v2)
Adds an appropriate edge between two vertices. |
Uses of Vertex in edu.uci.ics.jung.visualization |
---|
Fields in edu.uci.ics.jung.visualization declared as Vertex | |
---|---|
protected Vertex |
VisualizationViewer.GraphMouseImpl.picked
|
protected Vertex |
SimpleGraphMouse.vertexToDrag
the vertex to drag with a mouseDragged operation |
Methods in edu.uci.ics.jung.visualization that return Vertex | |
---|---|
protected Vertex |
AbstractLayout.getAVertex(Edge e)
Utility method, gets a single vertex from this edge. |
protected Vertex |
SpringLayout.getAVertex(Edge e)
|
Vertex |
AbstractLayout.getVertex(double x,
double y)
Deprecated. Use PickSupport instead |
Vertex |
FadingVertexLayout.getVertex(double x,
double y)
Deprecated. Use PickSupport instead A pass-through. |
Vertex |
GraphElementAccessor.getVertex(double x,
double y)
Returns a Vertex which is associated with the
location (x,y) . |
Vertex |
Layout.getVertex(double x,
double y)
Deprecated. Use PickSupport instead |
Vertex |
LayoutDecorator.getVertex(double x,
double y)
|
Vertex |
RadiusGraphElementAccessor.getVertex(double x,
double y)
Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance. |
Vertex |
RadiusPickSupport.getVertex(double x,
double y)
Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance. |
Vertex |
ShapePickSupport.getVertex(double x,
double y)
Iterates over Vertices, checking to see if x,y is contained in the Vertex's Shape. |
Vertex |
AbstractLayout.getVertex(double x,
double y,
double maxDistance)
Deprecated. Use PickSupport instead |
Vertex |
FadingVertexLayout.getVertex(double x,
double y,
double maxDistance)
Deprecated. Use PickSupport instead A pass-through. |
Vertex |
Layout.getVertex(double x,
double y,
double maxDistance)
Deprecated. Use PickSupport instead |
Vertex |
LayoutDecorator.getVertex(double x,
double y,
double maxDistance)
|
Vertex |
RadiusGraphElementAccessor.getVertex(double x,
double y,
double maxDistance)
Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance. |
Vertex |
RadiusPickSupport.getVertex(double x,
double y,
double maxDistance)
Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance. |
Methods in edu.uci.ics.jung.visualization with parameters of type Vertex | |
---|---|
void |
FRLayout.calcPositions(Vertex v)
|
void |
FRLayout.calcRepulsion(Vertex v1)
|
boolean |
AbstractLayout.dontMove(Vertex v)
Deprecated. As of version 1.7.5, superseded by Layout.isLocked(Vertex) . |
void |
AbstractLayout.forceMove(Vertex picked,
double x,
double y)
Forcibly moves a vertex to the (x,y) location by setting its x and y locations to the inputted location. |
void |
FRLayout.forceMove(Vertex picked,
double x,
double y)
|
void |
FadingVertexLayout.forceMove(Vertex picked,
double x,
double y)
Deprecated. Simply passes through the vertex. |
void |
Layout.forceMove(Vertex picked,
double x,
double y)
Forces a node to be moved to location x,y |
void |
LayoutDecorator.forceMove(Vertex picked,
double x,
double y)
|
Paint |
VertexColorToVertexPaintConverter.getDrawPaint(Vertex v)
Deprecated. |
Ellipse2D |
VertexShapeFactory.getEllipse(Vertex v)
Returns a Ellipse2D whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex. |
int |
FadingVertexLayout.getFadeLevel(Vertex v)
Deprecated. Static utility function returns the fade level of a given vertex. |
Paint |
VertexColorToVertexPaintConverter.getFillPaint(Vertex v)
Deprecated. |
FRLayout.FRVertexData |
FRLayout.getFRData(Vertex v)
|
Component |
DefaultGraphLabelRenderer.getGraphLabelRendererComponent(JComponent vv,
Object value,
Font font,
boolean isSelected,
Vertex vertex)
Returns the default label renderer for a Vertex |
Component |
GraphLabelRenderer.getGraphLabelRendererComponent(JComponent vv,
Object value,
Font font,
boolean isSelected,
Vertex vertex)
Returns the component used for drawing the label. |
ISOMLayout.ISOMVertexData |
ISOMLayout.getISOMVertexData(Vertex v)
|
Rectangle2D |
VertexShapeFactory.getRectangle(Vertex v)
Returns a Rectangle2D whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex. |
Shape |
VertexShapeFactory.getRegularPolygon(Vertex v,
int num_sides)
Returns a regular 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. |
Shape |
VertexShapeFactory.getRegularStar(Vertex v,
int num_points)
Returns a regular 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 |
VertexShapeFactory.getRoundRectangle(Vertex v)
Returns a RoundRectangle2D whose width and
height are defined by this instance's size and
aspect ratio functions for this vertex. |
SpringLayout.SpringVertexData |
SpringLayout.getSpringData(Vertex v)
|
double |
AbstractLayout.getX(Vertex v)
Returns the x coordinate of the vertex from the Coordinates object. |
double |
FadingVertexLayout.getX(Vertex vert)
Deprecated. Passthrough. |
double |
Layout.getX(Vertex v)
Returns the x coordinate of vertex v at this stage in the iteration. |
double |
LayoutDecorator.getX(Vertex v)
|
double |
AbstractLayout.getY(Vertex v)
Returns the y coordinate of the vertex from the Coordinates object. |
double |
FadingVertexLayout.getY(Vertex vert)
Deprecated. Passthrough. |
double |
Layout.getY(Vertex v)
Returns the y coordinate of vertex v at this stage in the iteration. |
double |
LayoutDecorator.getY(Vertex v)
|
void |
GraphMouseListener.graphClicked(Vertex v,
MouseEvent me)
|
void |
GraphMouseListener.graphPressed(Vertex v,
MouseEvent me)
|
void |
GraphMouseListener.graphReleased(Vertex v,
MouseEvent me)
|
protected abstract void |
AbstractLayout.initialize_local_vertex(Vertex v)
Initializes the local information on a single vertex. |
protected void |
FRLayout.initialize_local_vertex(Vertex v)
|
protected void |
ISOMLayout.initialize_local_vertex(Vertex v)
(non-Javadoc) |
protected void |
SpringLayout.initialize_local_vertex(Vertex v)
(non-Javadoc) |
protected void |
StaticLayout.initialize_local_vertex(Vertex v)
|
protected void |
AbstractLayout.initializeLocation(Vertex v,
Coordinates coord,
Dimension d)
Sets random locations for a vertex within the dimensions of the space. |
protected void |
PersistentLayoutImpl.initializeLocation(Vertex v,
Coordinates coord,
Dimension d)
Sets persisted location for a vertex within the dimensions of the space. |
boolean |
FadingVertexLayout.isHidden(Vertex v)
Deprecated. Static utility function returns the fade level of a given vertex. |
boolean |
AbstractLayout.isLocked(Vertex v)
|
boolean |
FadingVertexLayout.isLocked(Vertex v)
Deprecated. Passthrough. |
boolean |
Layout.isLocked(Vertex v)
Returns true if the position of vertex v
is locked. |
boolean |
LayoutDecorator.isLocked(Vertex v)
|
boolean |
MultiPickedState.isPicked(Vertex v)
|
boolean |
VisualizationViewer.isPicked(Vertex v)
Deprecated. Use getPickedState.isPicked(e) . |
protected void |
PluggableRenderer.labelVertex(Graphics g,
Vertex v,
String label,
int x,
int y)
Labels the specified vertex with the specified label. |
void |
AbstractLayout.lockVertex(Vertex v)
Adds the vertex to the DontMove list |
void |
FadingVertexLayout.lockVertex(Vertex vert)
Deprecated. Passthrough. |
void |
Layout.lockVertex(Vertex v)
Sets a flag which fixes this vertex in place. |
void |
LayoutDecorator.lockVertex(Vertex v)
|
void |
PersistentLayoutImpl.lockVertex(Vertex v)
|
protected void |
FadingVertexLayout.moveOutward(Vertex vert,
double x,
double y,
double speed)
Deprecated. Moves a vertex outward, toward the outer edge of the screen by calling forceMove on the vertex. |
protected void |
FadingVertexLayout.moveVertexPrettily(Vertex vert)
Deprecated. This code is called when a Vertex is being brought back onto the page. |
protected void |
AbstractLayout.offsetVertex(Vertex v,
double xOffset,
double yOffset)
|
void |
PluggableRenderer.paintIconForVertex(Graphics g,
Vertex v,
int x,
int y)
Paint v 's icon on g at (x,y) . |
void |
PluggableRenderer.paintShapeForVertex(Graphics2D g2d,
Vertex v,
Shape shape)
|
abstract void |
AbstractRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
PluggableRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
Paints the vertex v at the location (x,y)
on the graphics context g_gen . |
void |
Renderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
protected void |
VisualizationViewer.pick(Vertex picked,
boolean b)
Deprecated. Use getPickedState.pick(picked, b) . |
Component |
PluggableRenderer.prepareRenderer(GraphLabelRenderer graphLabelRenderer,
Object value,
boolean isSelected,
Vertex vertex)
|
void |
AbstractLayout.unlockVertex(Vertex v)
Removes the vertex from the DontMove list |
void |
FadingVertexLayout.unlockVertex(Vertex vert)
Deprecated. Passthrough. |
void |
Layout.unlockVertex(Vertex v)
Allows this vertex to be moved. |
void |
LayoutDecorator.unlockVertex(Vertex v)
|
void |
PersistentLayoutImpl.unlockVertex(Vertex v)
|
Uses of Vertex in edu.uci.ics.jung.visualization.contrib |
---|
Methods in edu.uci.ics.jung.visualization.contrib that return Vertex | |
---|---|
Vertex |
TreeLayout.getRootVertex()
|
Methods in edu.uci.ics.jung.visualization.contrib with parameters of type Vertex | |
---|---|
void |
DAGLayout.forceMove(Vertex picked,
int x,
int y)
Override forceMove so that if someone moves a node, we can re-layout everything. |
static Vector |
TreeLayout.getAtomics(Vertex p)
|
CircleLayout.CircleVertexData |
CircleLayout.getCircleData(Vertex v)
|
int |
TreeLayout.getDepth(Vertex v)
|
protected int |
KKLayoutInt.getDistance(Vertex v1,
Vertex v2)
Gets a distance (a length of the shortest path) between the specified vertices. |
protected void |
CircleLayout.initialize_local_vertex(Vertex v)
|
protected void |
KKLayout.initialize_local_vertex(Vertex v)
|
protected void |
KKLayoutInt.initialize_local_vertex(Vertex v)
|
protected void |
TreeLayout.initialize_local_vertex(Vertex v)
? |
protected void |
DAGLayout.initializeLocation(Vertex v,
Coordinates coord,
Dimension d)
Sets random locations for a vertex within the dimensions of the space. |
void |
CircleLayout.orderVertices(Vertex[] vertices)
Specifies the order of vertices. |
static void |
DAGLayout.propagateMinimumLevel(Vertex v)
A recursive method for allocating the level for each vertex. |
static void |
DAGLayout.setRoot(Vertex v)
Set vertex v to be level 0. |
void |
TreeLayout.setRootVertex(Vertex rootVertex_)
|
Uses of Vertex in edu.uci.ics.jung.visualization.control |
---|
Fields in edu.uci.ics.jung.visualization.control declared as Vertex | |
---|---|
protected Vertex |
AnimatedPickingGraphMousePlugin.vertex
the picked Vertex |
protected Vertex |
PickingGraphMousePlugin.vertex
the picked Vertex, if any |
Uses of Vertex in edu.uci.ics.jung.visualization.graphdraw |
---|
Methods in edu.uci.ics.jung.visualization.graphdraw with parameters of type Vertex | |
---|---|
protected String |
SettableRenderer.getLabel(Vertex v)
Deprecated. Simple label function returns the StringLabeller's notion of v's label. |
protected void |
SettableRenderer.paintLightVertex(Graphics g,
Vertex v,
int x,
int y,
String label)
Deprecated. |
void |
SettableRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
Deprecated. Paints the vertex, using the settings above (VertexColors, etc). |
Uses of Vertex in edu.uci.ics.jung.visualization.subLayout |
---|
Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type Vertex | |
---|---|
void |
SubLayoutDecorator.forceMove(Vertex picked,
double x,
double y)
|
Uses of Vertex in edu.uci.ics.jung.visualization.transform.shape |
---|
Methods in edu.uci.ics.jung.visualization.transform.shape with parameters of type Vertex | |
---|---|
protected void |
TransformingPluggableRenderer.labelVertex(Graphics g,
Vertex v,
String label,
int x,
int y)
overridden to wrap passed Graphics in my TransformingGraphics, then call overloaded labelVertex |
protected void |
TransformingPluggableRenderer.labelVertex(TransformingGraphics g,
Vertex v,
String label,
int x,
int y)
overloaded to use TransformingGraphics |
void |
PluggableRendererDecorator.paintIconForVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
PluggableRendererDecorator.paintShapeForVertex(Graphics2D g2d,
Vertex v,
Shape shape)
|
protected void |
TransformingPluggableRenderer.paintShapeForVertex(TransformingGraphics g2d,
Vertex v,
Shape shape)
|
void |
PluggableRendererDecorator.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
TransformingPluggableRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
overridden to wrap passed Graphics in TransformingGraphics then call overloaded paintVertex |
void |
TransformingPluggableRenderer.paintVertex(TransformingGraphics g2d,
Vertex v,
int x,
int y)
overloaded to use TransformingGraphics |
Component |
PluggableRendererDecorator.prepareRenderer(GraphLabelRenderer graphLabelRenderer,
Object value,
boolean isSelected,
Vertex vertex)
|
Uses of Vertex in samples.graph |
---|
Methods in samples.graph with parameters of type Vertex | |
---|---|
Paint |
ShortestPathDemo.MyVertexPaintFunction.getDrawPaint(Vertex v)
|
Paint |
ShortestPathDemo.MyVertexPaintFunction.getFillPaint(Vertex v)
|
Shape |
VertexImageShaperDemo.DemoVertexImageShapeFunction.getShape(Vertex v)
|
String |
PluggableRendererDemo.VoltageTips.getToolTipText(Vertex v)
|
protected void |
UnicodeLabelDemo.loadImages(Vertex[] vertices,
Map imageMap)
A nested class to demo ToolTips |
void |
BasicRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
protected void |
RankingDemo.recalculate(Graph graph,
Vertex startingVertex,
boolean fixAxes)
|
Uses of Vertex in samples.preview_new_graphdraw |
---|
Fields in samples.preview_new_graphdraw declared as Vertex | |
---|---|
protected Vertex |
VisVertex.mVertex
|
Methods in samples.preview_new_graphdraw that return Vertex | |
---|---|
Vertex |
EmittedLayout.getNearestVertex(double x,
double y)
|
Vertex |
VisVertex.getVertex()
|
Methods in samples.preview_new_graphdraw with parameters of type Vertex | |
---|---|
protected abstract VisVertex |
StaticLayout.createVisVertex(Vertex v)
|
VisVertex |
AbstractLayout.getVisVertex(Vertex v)
|
VisVertex |
EmittedLayout.getVisVertex(Vertex v)
|
Constructors in samples.preview_new_graphdraw with parameters of type Vertex | |
---|---|
VisVertex(Vertex v,
double x,
double y)
|
Uses of Vertex in samples.preview_new_graphdraw.impl |
---|
Methods in samples.preview_new_graphdraw.impl with parameters of type Vertex | |
---|---|
protected void |
GraphLayoutPanelMouseListener.fireVertexEvent(Vertex v,
double dist_to_closest_vertex,
MouseEvent e)
|
Uses of Vertex in samples.preview_new_graphdraw.iter |
---|
Methods in samples.preview_new_graphdraw.iter with parameters of type Vertex | |
---|---|
protected VisVertex |
UpdatableIterableLayout.addVisVertex(Vertex v)
Creates and returns a default VisVertex based on v . |
protected VisVertex |
IterableLayout.getVisVertex(Vertex v)
|
protected void |
UpdatableIterableLayout.removeVertex(Vertex v)
Removes v from the layout. |
Uses of Vertex in samples.preview_new_graphdraw.iterablelayouts |
---|
Methods in samples.preview_new_graphdraw.iterablelayouts that return Vertex | |
---|---|
protected Vertex |
SpringLayout.getAVertex(Edge e)
|
Methods in samples.preview_new_graphdraw.iterablelayouts with parameters of type Vertex | |
---|---|
protected VisVertex |
SpringLayout.addVisVertex(Vertex v)
|
protected double |
KKLayout.getDistance(Vertex v1,
Vertex v2)
Gets a distance (a length of the shortest path) between the specified vertices. |
Constructors in samples.preview_new_graphdraw.iterablelayouts with parameters of type Vertex | |
---|---|
SpringLayout.SpringVertex(Vertex v,
double x,
double y)
|
Uses of Vertex in samples.preview_new_graphdraw.staticlayouts |
---|
Methods in samples.preview_new_graphdraw.staticlayouts with parameters of type Vertex | |
---|---|
protected VisVertex |
CircleLayout.createVisVertex(Vertex v)
|
protected VisVertex |
IterableFromStaticEmittedLayout.createVisVertex(Vertex v)
|
protected VisVertex |
IterableToStaticLayout.createVisVertex(Vertex v)
|
protected VisVertex |
RandomLayout.createVisVertex(Vertex v)
|
protected VisVertex |
SimpleLayoutAlgorithm.createVisVertex(Vertex v)
|
Uses of Vertex in scratch.danyel |
---|
Methods in scratch.danyel with parameters of type Vertex | |
---|---|
boolean |
DemoTemporalRenderer.TimeFunc.acceptVertex(Vertex vertex)
|
boolean |
TemporalFunction.acceptVertex(Vertex vertex)
|
protected String |
QuickDrawRenderer.getLabel(Vertex v)
Simple label function returns the StringLabeller's notion of v's label. |
void |
BPVR.setClicked(Vertex vertex)
|
void |
BPVR.setClickedEdge(Vertex v1)
|
Constructors in scratch.danyel with parameters of type Vertex | |
---|---|
TMAMiniGraph(Vertex v)
|
Uses of Vertex in scratch.danyel.lazy |
---|
Classes in scratch.danyel.lazy that implement Vertex | |
---|---|
class |
LazySparseVertex
|
Methods in scratch.danyel.lazy that return Vertex | |
---|---|
Vertex |
LazySparseVertexFactory.getVertex(Object identifier)
|
Methods in scratch.danyel.lazy with parameters of type Vertex | |
---|---|
protected void |
LazySparseVertex.addNeighbor_internal(Edge e,
Vertex v)
|
protected Edge |
LazySparseVertexFactory.getLazyEdge(Vertex v1,
Vertex v2)
Returns the (unqiue) edge connected vertices 1 and 2. |
Uses of Vertex in scratch.danyel.sample |
---|
Methods in scratch.danyel.sample that return Vertex | |
---|---|
protected Vertex |
CircleLayout.getAVertex(Edge e)
|
Vertex |
CircleLayout.getVertex(double x,
double y)
|
Vertex |
CircleLayout.getVertex(double x,
double y,
double maxDistance)
|
Methods in scratch.danyel.sample with parameters of type Vertex | |
---|---|
protected void |
FadeBetweennessRenderer.drawNode(Graphics g,
Vertex v,
int x,
int y,
boolean isHidden,
int level,
String label)
|
protected void |
FadeRenderer.drawNode(Graphics g,
Vertex v,
int x,
int y,
boolean isHidden,
int level,
String label)
|
void |
CircleLayout.forceMove(Vertex picked,
double x,
double y)
|
CircleLayout.CircleVertexData |
CircleLayout.getCircleData(Vertex v)
|
Point2D |
CircleLayout.getLocation(Vertex v)
|
double |
CircleLayout.getX(Vertex v)
|
double |
CircleLayout.getY(Vertex v)
|
boolean |
CircleLayout.isLocked(Vertex v)
|
void |
CircleLayout.lockVertex(Vertex v)
|
void |
FadeRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
SimpleRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
CircleLayout.unlockVertex(Vertex v)
|
Uses of Vertex in scratch.danyel.triads |
---|
Methods in scratch.danyel.triads with parameters of type Vertex | |
---|---|
protected static boolean |
TriadicCensus.link(Vertex a,
Vertex b)
|
protected static boolean |
TriadicCensus.shouldCount(Indexer id,
Vertex u,
Vertex v,
Vertex w)
Make sure we have a canonical ordering: Returns true if u < w, or v < w < u and v doesn't link to w |
protected static int |
TriadicCensus.triCode(Vertex u,
Vertex v,
Vertex w)
This is the core of the technique in the paper. |
Uses of Vertex in scratch.scott |
---|
Methods in scratch.scott that return Vertex | |
---|---|
protected Vertex |
AestheticSpringVisualizer.getAVertex(Edge e)
|
Vertex |
AestheticSpringVisualizer.getVertex(double x,
double y)
|
Vertex |
AestheticSpringVisualizer.getVertex(double x,
double y,
double maxDistance)
|
Methods in scratch.scott with parameters of type Vertex | |
---|---|
void |
AestheticSpringVisualizer.forceMove(Vertex picked,
double x,
double y)
|
AestheticSpringVisualizer.SpringVertexData |
AestheticSpringVisualizer.getSpringData(Vertex v)
|
double |
AestheticSpringVisualizer.getX(Vertex v)
|
double |
AestheticSpringVisualizer.getY(Vertex v)
|
protected void |
FastScalableMDS.initialize_local_vertex(Vertex v)
|
boolean |
AestheticSpringVisualizer.isLocked(Vertex v)
|
void |
AestheticSpringVisualizer.lockVertex(Vertex v)
|
void |
BasicRenderer.paintVertex(Graphics g,
Vertex v,
int x,
int y)
|
void |
AestheticSpringVisualizer.unlockVertex(Vertex v)
|
Constructors in scratch.scott with parameters of type Vertex | |
---|---|
AestheticSpringVisualizer.SpringVertexData(Vertex v)
|
Uses of Vertex in test.edu.uci.ics.jung.algorithms.cluster |
---|
Methods in test.edu.uci.ics.jung.algorithms.cluster that return Vertex | |
---|---|
Vertex |
TestBicomponentClusterer.getVertex(Vertex[] v_array,
int i,
Graph g)
|
Vertex[] |
TestBicomponentClusterer.getVerticesByLabel(Graph graph,
StringLabeller sl)
|
Methods in test.edu.uci.ics.jung.algorithms.cluster with parameters of type Vertex | |
---|---|
void |
TestBicomponentClusterer.createEdges(Vertex[] v,
int[][] edge_array,
Graph g)
|
Vertex |
TestBicomponentClusterer.getVertex(Vertex[] v_array,
int i,
Graph g)
|
void |
TestBicomponentClusterer.testComponents(Graph graph,
Vertex[] vertices,
Set[] c,
StringLabeller sl)
|
Uses of Vertex in test.edu.uci.ics.jung.algorithms.importance |
---|
Fields in test.edu.uci.ics.jung.algorithms.importance declared as Vertex | |
---|---|
protected Vertex[] |
VoltageRankerTest.v
|
Uses of Vertex in test.edu.uci.ics.jung.graph.impl |
---|
Methods in test.edu.uci.ics.jung.graph.impl that return Vertex | |
---|---|
abstract Vertex |
BasicGraphTest.getVertex()
|
Vertex |
BasicGraphTest.BasicGraphSparseTest.getVertex()
|
abstract Vertex |
CopyGraphTest.getVertex()
|
Vertex |
CopyGraphTest.CopyGraphSparseTest.getVertex()
|
abstract Vertex |
FailingGraphTest.getVertex()
|
Vertex |
FailingGraphTest.SparseTest.getVertex()
|
abstract Vertex |
RemovalGraphTest.getVertex()
|
Vertex |
RemovalGraphTest.SparseTest.getVertex()
|
protected Vertex |
VertexTypeTest2.getVertexInstance()
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |