Uses of Interface
edu.uci.ics.jung.graph.Vertex

Packages that use Vertex

edu.uci.ics.jung.algorithms.blockmodel
edu.uci.ics.jung.algorithms.connectivity
edu.uci.ics.jung.algorithms.flows
edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.shortestpath
edu.uci.ics.jung.graph
edu.uci.ics.jung.graph.decorators
edu.uci.ics.jung.graph.filters
edu.uci.ics.jung.graph.filters.impl
edu.uci.ics.jung.graph.impl
edu.uci.ics.jung.utils
edu.uci.ics.jung.visualization
edu.uci.ics.jung.visualization.contrib
edu.uci.ics.jung.visualization.graphdraw
org.civi.graph

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

java.util.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.

Constructors in edu.uci.ics.jung.algorithms.blockmodel with parameters of type Vertex

GraphCollapser.UndirectedCollapsedEdge(Vertex opposite, Vertex superVertex, java.util.Set relevantEdges)

GraphCollapser.DirectedCollapsedEdge(Vertex opposite, Vertex superVertex, java.util.Set relevantEdges)

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
java.util.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, java.lang.String edgeCapacityKey, java.lang.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	RelativeAuthorityRanker.setPriorRankScore(Vertex v, double value) Allows the user to specify a value to set for the prior rank score
double	RandomWalkSTBetweenness.computeSTBetweenness(Vertex ithVertex, Vertex source, Vertex target)

Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type Vertex

RandomWalkSTBetweenness(UndirectedGraph g, Vertex s, Vertex t)
Constructor which initializes the algorithm

NodeRanking(int originalPos, double rankScore, Vertex vertex)
Allows the values to be set on construction.

Uses of Vertex in edu.uci.ics.jung.algorithms.shortestpath

Methods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Vertex

java.lang.Number	UnweightedShortestPath.getDistance(Vertex source, Vertex target)
java.util.Map	UnweightedShortestPath.getDistanceMap(Vertex source)
java.util.Map	UnweightedShortestPath.getIncomingEdgeMap(Vertex source)
int	UnweightedShortestPath.getShortestPath(Vertex source, Vertex target) Deprecated. use getDistance
java.util.List	ShortestPath.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.
abstract java.util.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.
java.lang.Number	Distance.getDistance(Vertex source, Vertex target) Returns the distance from the source vertex to the target vertex.
java.util.Map	Distance.getDistanceMap(Vertex source) Returns a Map which maps each vertex in the graph (including the source vertex) to its distance (represented as a Number) from source.
java.lang.Number	DijkstraShortestPath.getDistance(Vertex source, Vertex target) Returns the length of a shortest path from the source to the target vertex, or null if the target is not reachable from the source.
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.
java.util.Map	DijkstraShortestPath.getDistanceMap(Vertex source) Returns a LinkedHashMap which maps each vertex in the graph (including the source vertex) to its distance from the source vertex.
java.util.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.
java.util.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.
java.util.LinkedHashMap	DijkstraShortestPath.getDistanceMap(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 its distance from the source vertex.
java.util.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.
void	DijkstraShortestPath.reset(Vertex source) Clears all stored distances for the specified source vertex source.

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	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.
Vertex	DirectedEdge.getDest() Returns the destination of this directed edge.

Methods in edu.uci.ics.jung.graph with parameters of type Vertex

boolean	Vertex.isSuccessorOf(Vertex v) Returns true if this vertex is a successor of the specified vertex v, and false otherwise.
boolean	Vertex.isPredecessorOf(Vertex v) Returns true if this vertex is a predecessor of the specified vertex v, and false otherwise.
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.
java.util.Set	Vertex.findEdgeSet(Vertex v) Returns the set of all edges that connect this vertex with the specified vertex v.
Vertex	Graph.addVertex(Vertex v) Adds v to this graph, and returns a reference to the added vertex.
void	Graph.removeVertex(Vertex v) Removes v from this graph.
Vertex	Edge.getOpposite(Vertex v) Returns the vertex at the opposite end of this edge from the specified vertex v.

Uses of Vertex in edu.uci.ics.jung.graph.decorators

Methods in edu.uci.ics.jung.graph.decorators that return Vertex

Vertex	ToStringLabeller.removeLabel(java.lang.String string) This method is not meaningful; it throws an IllegalArgumentException
Vertex	ToStringLabeller.getVertex(java.lang.String label) Always returns null: this impl doesn't keep a table, and so can't meaningfully address this.
Vertex	StringLabeller.getVertex(java.lang.String label) Gets the Vertex from the graph associated with this label.
Vertex	StringLabeller.removeLabel(java.lang.String string)

Methods in edu.uci.ics.jung.graph.decorators with parameters of type Vertex

java.lang.String	VertexStringer.getLabel(Vertex v)
java.lang.String	ToStringLabeller.getLabel(Vertex v) Retunrs v.toString()
void	ToStringLabeller.setLabel(Vertex v, java.lang.String l) This method always throws an IllegalArgument exception: you cannot externally set the setstring method.
java.lang.String	StringLabeller.getLabel(Vertex v) Gets the String label associated with a particular Vertex.
void	StringLabeller.setLabel(Vertex v, java.lang.String l) Associates a Vertex with a Label, overrwriting any previous labels on this vertex.
java.lang.String	GlobalStringLabeller.getLabel(Vertex v) Gets the String label associated with a particular Vertex.
void	GlobalStringLabeller.setLabel(Vertex v, java.lang.String l) Associates a Vertex with a Label, overrwriting any previous labels on this vertex or vertices equal to it.

Uses of Vertex in edu.uci.ics.jung.graph.filters

Methods in edu.uci.ics.jung.graph.filters with parameters of type Vertex

boolean	VertexPredicateFilter.acceptVertex(Vertex vert)
boolean	TrivialFilter.acceptVertex(Vertex vert) Returns true for all vertices.
abstract boolean	GeneralVertexAcceptFilter.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	NumericDecorationFilter.acceptVertex(Vertex vertex)
boolean	DropSoloNodesFilter.acceptVertex(Vertex vert)
boolean	AlphabeticVertexFilter.acceptVertex(Vertex vert) Passes the vertex if its StringLabeller value compares over (or under) the threshold.

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	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.

Methods in edu.uci.ics.jung.graph.impl that return Vertex

Vertex	SparseTree.getRoot()
Vertex	DirectedSparseEdge.getSource()
Vertex	DirectedSparseEdge.getDest()
Vertex	BipartiteGraph.addVertex(Vertex av) Deprecated. Use addBipartiteVertex
Vertex	AbstractSparseGraph.addVertex(Vertex v)
Vertex	AbstractSparseEdge.getOpposite(Vertex vertex)

Methods in edu.uci.ics.jung.graph.impl with parameters of type Vertex

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.
java.util.Set	UndirectedSparseVertex.findEdgeSet(Vertex v)
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.
java.util.Set	SparseVertex.findEdgeSet(Vertex v)
boolean	SimpleUndirectedSparseVertex.isSuccessorOf(Vertex v)
boolean	SimpleUndirectedSparseVertex.isPredecessorOf(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.
boolean	SimpleSparseVertex.isSuccessorOf(Vertex v)
boolean	SimpleSparseVertex.isPredecessorOf(Vertex v)
Edge	SimpleSparseVertex.findEdge(Vertex v)
java.util.Set	SimpleSparseVertex.findEdgeSet(Vertex v)
boolean	SimpleDirectedSparseVertex.isSuccessorOf(Vertex v)
boolean	SimpleDirectedSparseVertex.isPredecessorOf(Vertex v)
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.
java.util.Set	SimpleDirectedSparseVertex.findEdgeSet(Vertex v) Returns the set of edges that connect this vertex to the specified vertex.
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.
java.util.Set	DirectedSparseVertex.findEdgeSet(Vertex v)
Vertex	BipartiteGraph.addVertex(Vertex av) Deprecated. Use addBipartiteVertex
void	BipartiteGraph.removeVertex(Vertex v)
Edge	AbstractSparseVertex.findEdge(Vertex v) Returns the edge that connects this vertex to the specified vertex v.
java.util.Set	AbstractSparseVertex.findEdgeSet(Vertex v)
Vertex	AbstractSparseGraph.addVertex(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.
Vertex	AbstractSparseEdge.getOpposite(Vertex vertex)

Constructors in edu.uci.ics.jung.graph.impl with parameters of type Vertex

UndirectedSparseEdge(Vertex from, Vertex to)
Creates an undirected edge that connects vertex from to vertex to (and vice versa).

SparseTree(Vertex root)

DirectedSparseEdge(Vertex from, Vertex to)
Creates a directed edge whose source is from and whose destination is to.

AbstractSparseEdge(Vertex from, Vertex to)
Creates an edge connecting vertices from and to.

Uses of Vertex in edu.uci.ics.jung.utils

Methods in edu.uci.ics.jung.utils that return Vertex

Vertex	VertexGenerator.create()
Vertex	TypedVertexGenerator.create() Creates a vertex whose type is determined by the requirements specified in the constructor.

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

Methods in edu.uci.ics.jung.visualization that return Vertex

Vertex	Layout.getVertex(double x, double y) Finds the closest vertex to an input (x,y) coordinate.
Vertex	Layout.getVertex(double x, double y, double maxDistance) Finds the closest vertex to an input (x,y) coordinate.
Vertex	FadingVertexLayout.getVertex(double x, double y) A pass-through.
Vertex	FadingVertexLayout.getVertex(double x, double y, double maxDistance) A pass-through.
Vertex	AbstractLayout.getVertex(double x, double y) Gets the vertex nearest to the location of the (x,y) location selected.
Vertex	AbstractLayout.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

boolean	VisualizationViewer.isPicked(Vertex v)
edu.uci.ics.jung.visualization.SpringLayout.SpringVertexData	SpringLayout.getSpringData(Vertex v)
void	Renderer.paintVertex(java.awt.Graphics g, Vertex v, int x, int y)
boolean	PickedInfo.isPicked(Vertex v)
double	Layout.getX(Vertex v) Returns the x coordinate of vertex v at this stage in the iteration.
double	Layout.getY(Vertex v) Returns the y coordinate of vertex v at this stage in the iteration.
void	Layout.lockVertex(Vertex v) Sets a flag which fixes this vertex in place.
void	Layout.unlockVertex(Vertex v) Allows this vertex to be moved.
void	Layout.forceMove(Vertex picked, int x, int y) Forces a node to be moved to location x,y
ISOMLayout.ISOMVertexData	ISOMLayout.getISOMVertexData(Vertex v)
void	GraphMouseListener.graphClicked(Vertex v, java.awt.event.MouseEvent me)
void	GraphMouseListener.graphPressed(Vertex v, java.awt.event.MouseEvent me)
void	GraphMouseListener.graphReleased(Vertex v, java.awt.event.MouseEvent me)
void	FRLayout.forceMove(Vertex picked, int x, int y)
void	FRLayout.calcPositions(Vertex v)
void	FRLayout.calcRepulsion(Vertex v1)
FRLayout.FRVertexData	FRLayout.getFRData(Vertex v)
double	FadingVertexLayout.getX(Vertex vert) Passthrough.
double	FadingVertexLayout.getY(Vertex vert) Passthrough.
int	FadingVertexLayout.getFadeLevel(Vertex v) Static utility function returns the fade level of a given vertex.
boolean	FadingVertexLayout.isHidden(Vertex v) Static utility function returns the fade level of a given vertex.
void	FadingVertexLayout.lockVertex(Vertex vert) Passthrough.
void	FadingVertexLayout.unlockVertex(Vertex vert) Passthrough.
void	FadingVertexLayout.forceMove(Vertex picked, int x, int y) Simply passes through the vertex.
abstract void	AbstractRenderer.paintVertex(java.awt.Graphics g, Vertex v, int x, int y)
boolean	AbstractLayout.dontMove(Vertex v) The set of vertices that have been locked.
Coordinates	AbstractLayout.getCoordinates(Vertex v) Returns the Coordinates object that stores the vertex' x and y location.
double	AbstractLayout.getX(Vertex v) Returns the x coordinate of the vertex from the Coordiantes object.
double	AbstractLayout.getY(Vertex v) Returns the y coordinate of the vertex from the Coordiantes object.
void	AbstractLayout.forceMove(Vertex picked, int x, int y) Forcibly moves a vertex to the (x,y) location by setting its x and y locations to the inputted location.
void	AbstractLayout.lockVertex(Vertex v) Adds the vertex to the DontMove list
void	AbstractLayout.unlockVertex(Vertex v) Removes the vertex from the DontMove list

Uses of Vertex in edu.uci.ics.jung.visualization.contrib

Methods in edu.uci.ics.jung.visualization.contrib with parameters of type Vertex

static void	DAGLayout.setRoot(Vertex v) Set vertex v to be level 0.
static void	DAGLayout.propagateMinimumLevel(Vertex v) A recursive method for allocating the level for each vertex.
void	DAGLayout.forceMove(Vertex picked, int x, int y) Override forceMove so that if someone moves a node, we can re-layout everything.
void	CircleLayout.orderVertices(Vertex[] vertices) Specifies the order of vertices.
CircleLayout.CircleVertexData	CircleLayout.getCircleData(Vertex v)

Uses of Vertex in edu.uci.ics.jung.visualization.graphdraw

Methods in edu.uci.ics.jung.visualization.graphdraw with parameters of type Vertex

java.awt.Color	VertexColorFunction.getForeColor(Vertex v) What color should the TEXT of this vertex be?
java.awt.Color	VertexColorFunction.getBackColor(Vertex v) What color should the FIELD of this vertex be?
void	SettableRenderer.paintVertex(java.awt.Graphics g, Vertex v, int x, int y) Paints the vertex, using the settings above (VertexColors, etc).

Uses of Vertex in org.civi.graph

Methods in org.civi.graph that return Vertex

Vertex	GraphModeler.addDocument(CiviDocument doc)
Vertex	GraphModeler.addKeyword(CiviKeyword kw)

Methods in org.civi.graph with parameters of type Vertex

Edge	GraphModeler.addEdge(Vertex v1, Vertex v2, float weight)