Uses of Interface
salvo.jesus.graph.Vertex

Packages that use Vertex

Package	Description
salvo.jesus.graph
salvo.jesus.graph.adaptor
salvo.jesus.graph.algorithm
salvo.jesus.graph.listener
salvo.jesus.graph.visual
salvo.jesus.graph.visual.layout
salvo.jesus.graph.xml

Uses of Vertex in salvo.jesus.graph

Classes in salvo.jesus.graph that implement Vertex

Modifier and Type	Class and Description
class	VertexImpl A vertex in a graph.

Fields in salvo.jesus.graph declared as Vertex

Modifier and Type	Field and Description
protected Vertex	EdgeImpl.vertexA The A vertex of the edge.
protected Vertex	EdgeImpl.vertexB The B vertex of the edge.

Methods in salvo.jesus.graph that return Vertex

Modifier and Type	Method and Description
Vertex	WeightedGraphImplFactory.createVertex()
Vertex	TreeImplFactory.createVertex()
Vertex	GraphImplFactory.createVertex()
Vertex	GraphFactory.createVertex() Factory method to create a Vertex.
Vertex	DirectedGraphImplFactory.createVertex()
Vertex	DirectedAcyclicGraphImplFactory.createVertex()
Vertex	WeightedGraphImpl.getClosest(Vertex v) Determines the Vertex that is 'closest' to the Vertex specified.
Vertex	WeightedGraph.getClosest(Vertex v) Determines the Vertex that is 'closest' to the Vertex specified.
Vertex	Path.getFirstVertex() Returns the first Vertex in the Path.
Vertex	Path.getLastVertex() Returns the last Vertex in the Path.
Vertex	EdgeImpl.getOppositeVertex(Vertex v) Returns the Vertex opposite to the specified Vertex in the edge.
Vertex	Edge.getOppositeVertex(Vertex v) Returns the Vertex opposite to the specified Vertex in the edge.
Vertex	TreeImpl.getParent(Vertex vertex)
Vertex	Tree.getParent(Vertex vertex) Returns the parent node of the node specified by the argument.
Vertex	TreeImpl.getRoot()
Vertex	Tree.getRoot() Returns the current root of the Tree.
Vertex	DirectedWeightedEdgeImpl.getSink() Returns the sink Vertex of the edge.
Vertex	DirectedEdgeImpl.getSink() Returns the sink Vertex of the edge.
Vertex	DirectedEdge.getSink() Returns the sink Vertex of the edge.
Vertex	DirectedWeightedEdgeImpl.getSource() Returns the source Vertex of the edge.
Vertex	DirectedEdgeImpl.getSource() Returns the source Vertex of the edge.
Vertex	DirectedEdge.getSource() Returns the source Vertex of the edge.
Vertex	GraphRemoveVertexEvent.getVertex() Returns the Vertex object is about to be removed from a Graph object
Vertex	GraphRemoveEdgeEvent.getVertex() If this edge is being removed implicitly due to the removal of a vertex, then the vertex being removed; else null.
Vertex	GraphAddVertexEvent.getVertex() Returns the Vertex object that was added to a Graph object
Vertex	EdgeImpl.getVertexA() Returns the endpoint A of the edge.
Vertex	Edge.getVertexA() Returns the endpoint A of the edge.
Vertex	EdgeImpl.getVertexB() Returns the endpoint B of the edge.
Vertex	Edge.getVertexB() Returns the endpoint B of the edge.

Methods in salvo.jesus.graph with parameters of type Vertex

Modifier and Type	Method and Description
void	GraphImpl.add(Vertex newvertex) This implementation of add(Vertex) should not normally be overridden by subclasses.
void	Graph.add(Vertex v) Adds a Vertex into the Graph.
static void	GraphUtil.addEdge(Graph g, Vertex v1, Vertex v2) Add an edge to a Graph, converting Exceptions into RuntimeExceptions.
Edge	GraphImpl.addEdge(Vertex v1, Vertex v2) This implementation of addEdge should not normally be overridden by subclasses.
Edge	Graph.addEdge(Vertex v1, Vertex v2) Creates an edge between two vertices and adds it into the Graph.
WeightedEdge	WeightedGraphImpl.addEdge(Vertex v1, Vertex v2, double weight) Convenience method to add a WeightedEdge with a specified weight into the WeightedGraph.
WeightedEdge	WeightedGraph.addEdge(Vertex v1, Vertex v2, double weight) Convenience method to add a WeightedEdge with a specified weight into the WeightedGraph.
Edge	TreeImpl.addNode(Vertex parent, Vertex childNode)
Edge	Tree.addNode(Vertex parent, Vertex childNode) Convenience method to adding nodes in a Tree.
static void	GraphUtil.addVertex(Graph g, Vertex v) Add a Vertex to a Graph, converting Exceptions into RuntimeExceptions.
Edge	GraphUtil.EdgeContractionRule.cloneEdge(Edge e, Vertex vA, Vertex vB) Called by contractVertices to clone an edge while changing its incidence.
boolean	GraphImpl.containsVertex(Vertex v) Test whether a vertex is included in this graph.
static void	GraphUtil.contractVertices(Graph g, Vertex vRemain, Vertex vRemove, GraphUtil.EdgeContractionRule rule) Contract two vertices within a graph.
Edge	WeightedGraphImplFactory.createEdge(Vertex v1, Vertex v2)
Edge	TreeImplFactory.createEdge(Vertex v1, Vertex v2)
Edge	GraphImplFactory.createEdge(Vertex v1, Vertex v2)
Edge	GraphFactory.createEdge(Vertex v1, Vertex v2) Factory method to create an Edge.
Edge	DirectedGraphImplFactory.createEdge(Vertex v1, Vertex v2)
Edge	DirectedAcyclicGraphImplFactory.createEdge(Vertex v1, Vertex v2)
List	GraphImpl.getAdjacentVertices(Vertex v) Returns the vertices adjacent to the specified vertex.
List	Graph.getAdjacentVertices(Vertex v) Returns the vertices adjacent to the specified vertex.
List	TreeImpl.getChildren(Vertex vertex)
List	Tree.getChildren(Vertex vertex) Returns the child nodes of the node specified by the argument.
Vertex	WeightedGraphImpl.getClosest(Vertex v) Determines the Vertex that is 'closest' to the Vertex specified.
Vertex	WeightedGraph.getClosest(Vertex v) Determines the Vertex that is 'closest' to the Vertex specified.
Set	GraphImpl.getConnectedSet(Vertex v)
Set	Graph.getConnectedSet(Vertex v) Returns the connected set to which the specified vertex belongs.
int	GraphImpl.getDegree(Vertex v) Returns the degree of the vertex, which is simply the number of edges of the vertex.
int	Graph.getDegree(Vertex v) Returns the degree of the vertex, which is simply the number of edges of the vertex.
int	TreeImpl.getDepth(Vertex node)
int	Tree.getDepth(Vertex node) Returns the depth of the node in the Tree.
DirectedEdge	DirectedGraphImpl.getEdge(Vertex fromvertex, Vertex tovertex) Returns an Edge in the Graph whose origin is fromVertex and destination is toVertex.
DirectedEdge	DirectedGraph.getEdge(Vertex fromvertex, Vertex tovertex) Returns an Edge in the Graph whose origin is fromVertex and destination is toVertex.
List	GraphImpl.getEdges(Vertex v) Returns an unmodifiable List of edges of the specified vertex.
List	Graph.getEdges(Vertex v) Returns a List of edges of the specified vertex.
List	DirectedGraphImpl.getIncomingAdjacentVertices(Vertex v) Returns the vertices that are adjacent to a specified Vertex where the Edge is incoming from the specified Vertex to the adjacent vertex.
List	DirectedGraph.getIncomingAdjacentVertices(Vertex v) Returns the vertices that are adjacent to a specified Vertex where the Edge is incoming from the specified Vertex to the adjacent vertex.
List	DirectedGraphImpl.getIncomingEdges(Vertex v) Returns the incoming edges of a particular Vertex in the Graph.
List	DirectedGraph.getIncomingEdges(Vertex v) Returns the incoming edges of a particular Vertex in the Graph.
Vertex	EdgeImpl.getOppositeVertex(Vertex v) Returns the Vertex opposite to the specified Vertex in the edge.
Vertex	Edge.getOppositeVertex(Vertex v) Returns the Vertex opposite to the specified Vertex in the edge.
List	DirectedGraphImpl.getOutgoingAdjacentVertices(Vertex v) Returns the vertices that are adjacent to a specified Vertex where the Edge is outgoing from the specified Vertex to the adjacent vertex.
List	DirectedGraph.getOutgoingAdjacentVertices(Vertex v) Returns the vertices that are adjacent to a specified Vertex where the Edge is outgoing from the specified Vertex to the adjacent vertex.
List	DirectedGraphImpl.getOutgoingEdges(Vertex v) Returns the outgoing edges of a particular Vertex in the Graph.
List	DirectedGraph.getOutgoingEdges(Vertex v) Returns the outgoing edges of a particular Vertex in the Graph.
Vertex	TreeImpl.getParent(Vertex vertex)
Vertex	Tree.getParent(Vertex vertex) Returns the parent node of the node specified by the argument.
Tree	TreeImpl.getSubTree(Vertex subTreeRootVertex)
Tree	Tree.getSubTree(Vertex subTreeRootVertex) Returns a new instance of a Tree that is rooted from the specified node.
boolean	GraphImpl.isConnected(Vertex v1, Vertex v2) Determines if two vertices are connected
boolean	Graph.isConnected(Vertex v1, Vertex v2) Determines if two vertices are connected
boolean	DirectedGraphImpl.isCycle(Vertex fromVertex) Determines if there is a cycle from Vertex fromVertex.
boolean	DirectedGraph.isCycle(Vertex fromVertex) Determines if there is a cycle from Vertex fromVertex.
boolean	TreeImpl.isLeaf(Vertex vertex)
boolean	Tree.isLeaf(Vertex vertex) Returns true if the specified node is a leaf.
boolean	DirectedGraphImpl.isPath(Vertex fromVertex, Vertex toVertex) Determines if there is a path from Vertex fromVertex to Vertex toVertex.
boolean	DirectedGraph.isPath(Vertex fromVertex, Vertex toVertex) Determines if there is a path from Vertex fromVertex to Vertex toVertex.
void	GraphImpl.remove(Vertex v) This implementation of remove should not normally be overridden by subclasses.
void	Graph.remove(Vertex v) Removes the specified Vertex and all of its incident edges from the Graph.
void	GraphImpl.removeEdges(Vertex v) This implementation of removeEdges should not normally be overridden by subclasses.
void	Graph.removeEdges(Vertex v) Removes incident Edges of a Vertex.
static void	GraphUtil.removeVertex(Graph g, Vertex v) Remove a Vertex from a Graph, converting Exceptions into RuntimeExceptions.
List	DirectedAcyclicGraphImpl.reverseTopologicalSort(Vertex startat)
List	DirectedAcyclicGraph.reverseTopologicalSort(Vertex startat)
void	TreeImpl.setRoot(Vertex rootVertex)
void	Tree.setRoot(Vertex rootVertex) Sets the root of the Tree.
WeightedGraph	WeightedGraphImpl.shortestPath(Vertex vertex) Determine a shortest path spanning tree for the weighted graph.
WeightedGraph	WeightedGraph.shortestPath(Vertex vertex) Determine a shortest path spanning tree for the weighted graph.
List	DirectedAcyclicGraphImpl.topologicalSort(Vertex startat)
List	DirectedAcyclicGraph.topologicalSort(Vertex startat)
List	GraphImpl.traverse(Vertex startat) Traverses the Graph starting at startat Vertex.
List	Graph.traverse(Vertex startat) Traverses the Graph starting at startat Vertex by performing a depth-first traversal.
boolean	Visitor.visit(Vertex vertexToVisit)
boolean	StopAtVisitor.visit(Vertex objectToVisit) Override of superclass' visit() method.
boolean	NullVisitor.visit(Vertex vertexToVisit)

Constructors in salvo.jesus.graph with parameters of type Vertex

Constructor and Description
DirectedEdgeImpl(Vertex sourceVertex, Vertex sinkVertex) Creates an DirectedEdgeImpl object whose origin and destination vertices are specified by the method parameters.
DirectedWeightedEdgeImpl(Vertex sourceVertex, Vertex sinkVertex, double weight) Creates a DirectedWeightedEdgeImpl object whose source and sink vertices and weight are specified by the parameters.
EdgeImpl(Vertex a, Vertex b) Creates an UndirectedEdge object.
GraphAddVertexEvent(Object source, Vertex newvertex, Edge edge) Creates a GraphAddVertexEvent object indicating the source of the event and the Vertex that was added to a Graph object
GraphRemoveEdgeEvent(Object source, Edge edgetoremove, Vertex vertex) Creates a GraphRemoveEdgeEvent object indicating the source of the event and the Edge that is about to be removed from a Graph object
GraphRemoveVertexEvent(Object source, Vertex vertextoremove) Creates a GraphRemoveVertexEvent object indicating the source of the event and the Vertex is about to be removed from a Graph object
StopAtVisitor(Vertex objectToCheck) Creates a new instance of StopAtVisitor and specifies which Vertex stop
WeightedEdgeImpl(Vertex a, Vertex b, double weight) Creates an WeightedEdgeImpl object.

Uses of Vertex in salvo.jesus.graph.adaptor

Methods in salvo.jesus.graph.adaptor with parameters of type Vertex

Modifier and Type	Method and Description
void	GraphDelegator.add(Vertex v)
Edge	GraphDelegator.addEdge(Vertex v1, Vertex v2)
List	GraphDelegator.getAdjacentVertices(Vertex v)
Set	GraphDelegator.getConnectedSet(Vertex v)
int	GraphDelegator.getDegree(Vertex v)
DirectedEdge	DirectedGraphDelegator.getEdge(Vertex fromvertex, Vertex tovertex)
List	GraphDelegator.getEdges(Vertex v)
List	DirectedGraphDelegator.getIncomingAdjacentVertices(Vertex v)
List	DirectedGraphDelegator.getIncomingEdges(Vertex v)
List	DirectedGraphDelegator.getOutgoingAdjacentVertices(Vertex v)
List	DirectedGraphDelegator.getOutgoingEdges(Vertex v)
boolean	GraphDelegator.isConnected(Vertex v1, Vertex v2)
boolean	DirectedGraphDelegator.isCycle(Vertex fromvertex)
boolean	DirectedGraphDelegator.isPath(Vertex fromvertex, Vertex tovertex)
void	GraphDelegator.remove(Vertex v)
void	GraphDelegator.removeEdges(Vertex v)
List	DirectedAcyclicGraphAdaptor.reverseTopologicalSort(Vertex startat)
List	DirectedAcyclicGraphAdaptor.topologicalSort(Vertex startat)
List	GraphDelegator.traverse(Vertex startat)

Uses of Vertex in salvo.jesus.graph.algorithm

Methods in salvo.jesus.graph.algorithm that return Vertex

Modifier and Type	Method and Description
Vertex	GraphContractionAlgorithm.getContractionVertex(Vertex v) Find the resulting contraction for a Vertex.

Methods in salvo.jesus.graph.algorithm with parameters of type Vertex

Modifier and Type	Method and Description
void	GraphContractionAlgorithm.contractVertexPair(Vertex vRemain, Vertex vRemove) Contract two arbitrary vertices within a graph.
protected abstract Edge	GraphContractionAlgorithm.copyEdge(Edge oldEdge, Vertex vA, Vertex vB) Subclass method called to add a new contracted edge equivalent to oldEdge, but connecting vA to vB.
boolean	CycleDetectionAlgorithmDFS.detectCycles(Vertex v)
abstract boolean	CycleDetectionAlgorithm.detectCycles(Vertex v) Determine whether an individual vertex is on a cycle.
void	CycleDetectionAlgorithmDFS.findCycleSubgraph(Graph subgraph, Vertex v)
abstract void	CycleDetectionAlgorithm.findCycleSubgraph(Graph subgraph, Vertex v) Find the subgraph of all cycles which contain a particular vertex.
protected List	DepthFirstGraphTraversal.getAdjacentVertices(Vertex v) Get the vertices adjacent to v.
protected List	DepthFirstDirectedGraphTraversal.getAdjacentVertices(Vertex v) Override super to only get the outgoing adjacent vertices.
Vertex	GraphContractionAlgorithm.getContractionVertex(Vertex v) Find the resulting contraction for a Vertex.
List	TopologicalSorting.reverseTraverse(Vertex startat) Perform a reverse topological sort of the subgraph reachable via outgoing edges from a specific vertex.
WeightedGraph	ShortestPathDijkstraAlgorithm.shortestPath(Vertex from) Determines the shortest path from a given vertex to all other vertices that are in the same connected set as the given vertex in the weighted graph using Dijkstra's algorithm.
abstract WeightedGraph	ShortestPathAlgorithm.shortestPath(Vertex from) Abstract method to be implemented by subclasses to determine a shortest path spanning tree from a given vertex in the form of a graph.
List	TopologicalSorting.traverse(Vertex startat) Perform a topological sort of the subgraph reachable via outgoing edges from a specific vertex.
abstract List	GraphTraversal.traverse(Vertex startat) Abstract traversal method to be implemented by subclasses.
List	DepthFirstGraphTraversal.traverse(Vertex startat)
List	BreadthFirstTraversal.traverse(Vertex startat)
int	TopologicalSorting.traverse(Vertex startat, List visited, Visitor visitor) Perform a topological sort of the subgraph reachable via outgoing edges from a specific vertex.
abstract int	GraphTraversal.traverse(Vertex startat, List visited, Visitor visitor) Abstract traversal method to be implemented by subclasses.
int	DepthFirstGraphTraversal.traverse(Vertex startat, List visited, Visitor visitor)
int	BreadthFirstTraversal.traverse(Vertex startat, List visited, Visitor visitor)
List	TopologicalSorting.traverse(Vertex startat, Visitor visitor) Perform a topological sort of the subgraph reachable via outgoing edges from a specific vertex.
abstract List	GraphTraversal.traverse(Vertex startat, Visitor visitor) Abstract traversal method to be implemented by subclasses.
List	DepthFirstGraphTraversal.traverse(Vertex startat, Visitor visitor)
List	BreadthFirstTraversal.traverse(Vertex startat, Visitor visitor)

Uses of Vertex in salvo.jesus.graph.listener

Methods in salvo.jesus.graph.listener that return Vertex

Modifier and Type	Method and Description
Vertex	SimplePathListener.getFirstVertex()
Vertex	PathListener.getFirstVertex() Returns the first Vertex in the Path.
Vertex	AbstractPathListener.getFirstVertex()
Vertex	SimplePathListener.getLastVertex()
Vertex	PathListener.getLastVertex() Returns the last Vertex in the Path.
Vertex	AbstractPathListener.getLastVertex()
Vertex	TreeListener.getParent(Vertex vertex)
Vertex	TreeListener.getRoot()

Methods in salvo.jesus.graph.listener with parameters of type Vertex

Modifier and Type	Method and Description
List	TreeListener.getChildren(Vertex vertex)
Set	ConnectedSetListener.getConnectedSet(Vertex v) Get the connected set to which the given vertex belongs.
int	TreeListener.getDepth(Vertex node)
Vertex	TreeListener.getParent(Vertex vertex)
Tree	TreeListener.getSubTree(Vertex subTreeRootVertex)
protected boolean	SimplePathListener.isEndpoint(Vertex v)
boolean	TreeListener.isLeaf(Vertex vertex)
void	TreeListener.setRoot(Vertex rootVertex)
List	PathListener.PathTraversal.traverse(Vertex startat)
int	PathListener.PathTraversal.traverse(Vertex startat, List visited, Visitor visitor)
List	PathListener.PathTraversal.traverse(Vertex startat, Visitor visitor)

Uses of Vertex in salvo.jesus.graph.visual

Methods in salvo.jesus.graph.visual that return Vertex

Modifier and Type	Method and Description
Vertex	VisualVertex.getVertex() Returns the Vertex that VisualVertex encapsulates.

Methods in salvo.jesus.graph.visual with parameters of type Vertex

Modifier and Type	Method and Description
void	VisualGraph.add(Vertex vertex) Adds a Vertex object to the Graph object encapsulated by the VisualGraph object.
void	VisualGraph.add(Vertex vertex, Font f) Adds a Vertex object to the Graph object encapsulated by the VisualGraph object then set the Font used by corresponding VisualVertex object.
VisualVertex	VisualGraph.getVisualVertex(Vertex vertex) Returns the VisualVertex object for the corresponding Vertex object in the Graph object encapsulated by VisualGraph.
void	VisualGraph.remove(Vertex vertex) Removes a Vertex object from the Graph object encapsulated by the VisualGraph object.
void	VisualVertex.setVertex(Vertex vertex) Sets the vertex that the VisualVertex encapsulates.
void	VisualGraph.setVisualVertex(Vertex vertex, VisualVertex newVisualVertex)

Constructors in salvo.jesus.graph.visual with parameters of type Vertex

Constructor and Description
VisualVertex(Vertex vertex, Font f, VisualGraph vGraph) Creates a new VisualVertex object that encapsulates the given Vertex object using the Font specified to draw the string inside the VisualVertex.
VisualVertex(Vertex vertex, Shape shape, Color c, Color bgcolor, Font f, VisualGraph vGraph) Creates a new VisualVertex object that encapsulates the given Vertex object with the given visual attributes.
VisualVertex(Vertex vertex, VisualGraph vGraph) Creates a new VisualVertex object that encapsulates the given Vertex object This defaults the font to Lucida Sans, the outline color to black and the fill or background colot to Color( 0, 255, 255 ).

Uses of Vertex in salvo.jesus.graph.visual.layout

Methods in salvo.jesus.graph.visual.layout with parameters of type Vertex

Modifier and Type	Method and Description
boolean	RadialTreeLayout.visit(Vertex vertexToVisit) Implementation of the visit() method of the Visitor interface.
boolean	LayeredTreeLayout.visit(Vertex vertexToVisit) Implementation of the visit() method of the Visitor interface.

Uses of Vertex in salvo.jesus.graph.xml

Methods in salvo.jesus.graph.xml with parameters of type Vertex

Modifier and Type	Method and Description
void	GraphToXMLHandler.endSerializeVertex(Vertex vertex)
void	GraphToXGMMLSAXHandler.endSerializeVertex(Vertex vertex) Calls the delegate's endSerializerVertex() method
void	GraphToXGMMLDOMHandler.endSerializeVertex(Vertex vertex) Calls the delegate's endSerializerVertex() method
void	XMLToGraphHandler.mapIDToVertex(String idValue, Vertex aVertex)
void	GraphToXMLEventGeneratorImpl.notifySerializeVertex(Vertex vertex)
void	GraphToXMLEventGenerator.notifySerializeVertex(Vertex vertex)
void	GraphToXMLHandler.serializeVertex(Vertex vertex) Called only once for each Vertex in the Graph being serialized.
void	GraphToXGMMLSAXHandler.serializeVertex(Vertex vertex) Calls the delegate's serializerVertex() method
void	GraphToXGMMLDOMHandler.serializeVertex(Vertex vertex) Calls the delegate's serializerVertex() method