|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Vertex | |
---|---|
laas.friends.cosmopen.graphAnalysis | This package provides the internal graph manipulation engine. |
salvo.jesus.graph | |
salvo.jesus.graph.algorithm |
Uses of Vertex in laas.friends.cosmopen.graphAnalysis |
---|
Subclasses of Vertex in laas.friends.cosmopen.graphAnalysis | |
---|---|
(package private) class |
CondensedVertex
The type of vertices that is used in CondensedGraph . |
class |
NamedVertex
This class represents a class tag extracted from an xml file generated with hydrogen. |
Methods in laas.friends.cosmopen.graphAnalysis with parameters of type Vertex | |
---|---|
void |
DirectedGraphWithDictImpl.add(Vertex passedNamedVertex)
Add a NamedVertex instances to the DirectedGraphWithDictImpl . |
void |
DirectedGraphWithDict.add(Vertex newNamedVertex)
Add a NamedVertex instances to the DirectedGraphWithDict . |
void |
CallGraph.add(Vertex aNewNamedVertex)
|
Edge |
DirectedGraphWithDictImpl.createEdge(Vertex v1,
Vertex v2)
|
boolean |
DirectedGraphWithDictImpl.doesContainVertex(Vertex candidate)
|
boolean |
DirectedGraphWithDict.doesContainVertex(Vertex candidate)
|
int |
DirectedGraphWithDictImpl.getDegree(Vertex candidate)
|
int |
DirectedGraphWithDict.getDegree(Vertex candidate)
|
int |
DirectedGraphWithDictImpl.getInDegree(Vertex candidate)
|
int |
DirectedGraphWithDict.getInDegree(Vertex candidate)
|
int |
DirectedGraphWithDictImpl.getOutDegree(Vertex candidate)
|
int |
DirectedGraphWithDict.getOutDegree(Vertex candidate)
|
protected abstract java.util.Collection |
DirectedGraphWithDictImpl.ExtractingVisitor_.nextEdges(Vertex vertex)
This method determines how the visitors adds edges and vertices to the graph under construction. |
void |
DirectedGraphWithDictImpl.remove(Vertex v)
|
void |
CallGraph.remove(Vertex v)
|
boolean |
DirectedGraphWithDictImpl.ExtractingVisitor_.visit(Vertex vertexToVisit)
|
Constructors in laas.friends.cosmopen.graphAnalysis with parameters of type Vertex | |
---|---|
NamedEdge(Vertex sourceVertex,
Vertex sinkVertex)
|
Uses of Vertex in salvo.jesus.graph |
---|
Fields in salvo.jesus.graph declared as Vertex | |
---|---|
(package private) Vertex |
StopAtVisitor.objectToCheck
Vertex to check for when visiting a vertex |
(package private) Vertex |
CycleCheckVisitor.objectToCheck
Vertex to check for a cycle path |
private Vertex |
DirectedEdgeWeakImpl.sinkVertex
The sink Vertex of the Edge |
private Vertex |
DirectedEdgeWeakImpl.sourceVertex
The source Vertex of the Edge |
(package private) Vertex |
GraphRemoveVertexEvent.vertex
The Vertex object that is about to be removed from a Graph object |
(package private) Vertex |
GraphAddVertexEvent.vertex
The Vertex object that was added to a Graph object |
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 | |
---|---|
Vertex |
PathImpl.getFirstVertex()
Returns the first Vertex in the Path. |
Vertex |
Path.getFirstVertex()
Returns the first Vertex in the Path. |
Vertex |
PathImpl.getLastVertex()
Returns the last 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 |
DirectedEdgeWeakImpl.getOppositeVertex(Vertex vertex)
Empty method implemetation that returns null. |
Vertex |
DirectedEdgeWeakImpl.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 |
DirectedEdgeWeakImpl.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 |
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 |
DirectedEdgeWeakImpl.getVertexA()
Empty method implemetation that returns null. |
Vertex |
EdgeImpl.getVertexB()
Returns the endpoint B of the edge. |
Vertex |
Edge.getVertexB()
Returns the endpoint B of the edge. |
Vertex |
DirectedEdgeWeakImpl.getVertexB()
Empty method implemetation that returns null. |
Methods in salvo.jesus.graph with parameters of type Vertex | |
---|---|
void |
SimplePathImpl.add(Vertex newVertex)
Adds a Vertex into the Path. |
void |
PathImpl.add(Vertex newVertex)
Adds a Vertex into the Path. |
void |
GraphImpl.add(Vertex newvertex)
Adds a Vertex into the Graph. |
void |
Graph.add(Vertex v)
Adds a Vertex into the Graph. |
void |
DirectedGraphWeakImpl.add(Vertex newvertex)
Adds a new Vector in both the incoming and outgoing Vector of Edges. |
void |
DirectedGraphImpl.add(Vertex newvertex)
Adds a Vertex into the Graph. |
void |
CyclePathImpl.add(Vertex newVertex)
Adds a Vertex into the Path. |
Edge |
GraphImpl.addEdge(Vertex v1,
Vertex v2)
Adds an Edge into the Graph. |
Edge |
Graph.addEdge(Vertex v1,
Vertex v2)
Adds an Edge into the Graph. |
Edge |
DirectedGraphWeakImpl.addEdge(Vertex v1,
Vertex v2)
Empty method implemetation that returns null. |
Edge |
DirectedGraphImpl.addEdge(Vertex v1,
Vertex v2)
Adds an Edge into the Graph. |
Edge |
DirectedAcyclicGraphImpl.addEdge(Vertex fromVertex,
Vertex toVertex)
Adds an Edge into the DirectedAcyclicGraph. |
Edge |
GraphImpl.createEdge(Vertex v1,
Vertex v2)
Method to create the proper type of Edge class. |
Edge |
Graph.createEdge(Vertex v1,
Vertex v2)
Method to create the proper type of Edge class. |
Edge |
DirectedGraphWeakImpl.createEdge(Vertex v1,
Vertex v2)
Empty method implemetation that returns null. |
Edge |
DirectedGraphImpl.createEdge(Vertex v1,
Vertex v2)
Factory method implementation that creates an instance of a DirectedEdge. |
java.util.Collection |
GraphImpl.getAdjacentVertices(Vertex v)
Returns the vertices adjacent to the specified vertex. |
java.util.Collection |
Graph.getAdjacentVertices(Vertex v)
Returns the vertices adjacent to the specified vertex. |
java.util.Collection |
DirectedGraphWeakImpl.getAdjacentVertices(Vertex v)
Empty method implemetation that returns null. |
private java.util.Collection |
DirectedGraphWeakImpl.getAdjacentVertices(Vertex v,
boolean outGoing)
Returns the vertices that are adjacent to a specified Vertex, respecting the direction of the Edge from the specified Vertex. |
java.util.Collection |
GraphImpl.getConnectedSet(Vertex v)
Returns the connected set to which the specified vertex belongs. |
java.util.Collection |
Graph.getConnectedSet(Vertex v)
Returns the connected set to which the specified vertex belongs. |
java.util.Collection |
DirectedGraphWeakImpl.getConnectedSet(Vertex v)
Empty method implemetation that returns null. |
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 |
DirectedGraphWeakImpl.getDegree(Vertex v)
Empty method implemetation that returns 0. |
DirectedEdge |
DirectedGraphWeakImpl.getEdge(Vertex fromvertex,
Vertex tovertex)
Returns an Edge in the Graph whose origin is fromVertex and destination is toVertex. |
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. |
java.util.Collection |
GraphImpl.getEdges(Vertex v)
Returns a Collection of edges of the specified vertex. |
java.util.Collection |
Graph.getEdges(Vertex v)
Returns a Vector of edges of the specified vertex. |
java.util.Collection |
DirectedGraphWeakImpl.getEdges(Vertex v)
Empty method implemetation that returns null. |
java.util.Collection |
DirectedGraphWeakImpl.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. |
java.util.Collection |
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. |
java.util.Collection |
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. |
java.util.Collection |
DirectedGraphWeakImpl.getIncomingEdges(Vertex v)
Returns the incoming edges of a particular Vertex in the Graph. |
java.util.Collection |
DirectedGraphImpl.getIncomingEdges(Vertex v)
Returns the incoming edges of a particular Vertex in the Graph. |
java.util.Collection |
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. |
Vertex |
DirectedEdgeWeakImpl.getOppositeVertex(Vertex vertex)
Empty method implemetation that returns null. |
java.util.Collection |
DirectedGraphWeakImpl.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. |
java.util.Collection |
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. |
java.util.Collection |
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. |
java.util.Collection |
DirectedGraphWeakImpl.getOutgoingEdges(Vertex v)
Returns the outgoing edges of a particular Vertex in the Graph. |
java.util.Collection |
DirectedGraphImpl.getOutgoingEdges(Vertex v)
Returns the outgoing edges of a particular Vertex in the Graph. |
java.util.Collection |
DirectedGraph.getOutgoingEdges(Vertex v)
Returns the outgoing edges of a particular Vertex in the Graph. |
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 |
DirectedGraphWeakImpl.isConnected(Vertex v1,
Vertex v2)
Empty method implemetation that returns false. |
boolean |
DirectedGraphWeakImpl.isCycle(Vertex fromVertex)
Determines if there is a cycle from Vertex fromVertex. |
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 |
DirectedGraphWeakImpl.isPath(Vertex fromVertex,
Vertex toVertex)
Determines if there is a path from Vertex fromVertex to Vertex toVertex. |
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.mergeconnectedSet(Vertex v1,
Vertex v2)
Merges the connected sets to which Vertex v1 and Vertex v2 belongs, if they are not yet connected. |
void |
Graph.mergeconnectedSet(Vertex v1,
Vertex v2)
Merges the connected sets to which Vertex v1 and Vertex v2 belongs, if they are not yet connected. |
void |
DirectedGraphWeakImpl.mergeconnectedSet(Vertex v1,
Vertex v2)
Empty method implemetation that returns null. |
void |
PathImpl.remove(Vertex v)
Throws a NoSuchMethodException as this method is not directly supported by the Path. |
void |
GraphImpl.remove(Vertex v)
|
void |
Graph.remove(Vertex v)
Removes the specified Edge from the Graph. |
void |
DirectedGraphWeakImpl.remove(Vertex someVertex)
Removes the vertex's vectors of incoming and outgoing edges.. |
void |
DirectedGraphImpl.remove(Vertex vertex)
Removes a Vertex from the Graph. |
void |
PathImpl.removeEdges(Vertex v)
Throws a NoSuchMethodException as this method is not directly supported by the Path. |
void |
GraphImpl.removeEdges(Vertex v)
Removes incident Edges of a Vertex. |
void |
Graph.removeEdges(Vertex v)
Removes incident Edges of a Vertex. |
void |
DirectedGraphWeakImpl.removeEdges(Vertex v)
Empty method implemetation that returns null. |
java.util.Vector |
DirectedAcyclicGraphImpl.reverseTopologicalSort(Vertex startat)
Perform a reverse topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
java.util.Vector |
DirectedAcyclicGraph.reverseTopologicalSort(Vertex startat)
Perform a reverse topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
private void |
CyclePathImpl.setFlags(Vertex newVertex)
Sets the stastus of the flags depending on what will be the effect should a specified Vertex is added to the CyclePath. |
java.util.Vector |
DirectedAcyclicGraphImpl.topologicalSort(Vertex startat)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
java.util.Vector |
DirectedAcyclicGraph.topologicalSort(Vertex startat)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
java.util.Vector |
GraphImpl.traverse(Vertex startat)
Traverses the Graph starting at startat Vertex. |
java.util.Vector |
Graph.traverse(Vertex startat)
Traverses the Graph starting at startat Vertex by performing a depth-first traversal. |
java.util.Vector |
DirectedGraphWeakImpl.traverse(Vertex startat)
Empty method implemetation that returns null. |
private void |
SimplePathImpl.validatePath(Vertex vertex)
Throws an exception if the vertex being added will result in a non-simple path. |
boolean |
Visitor.visit(Vertex vertexToVisit)
|
boolean |
StopAtVisitor.visit(Vertex objectToVisit)
Override of superclass' visit() method. |
boolean |
NullVisitor.visit(Vertex vertexToVisit)
|
boolean |
CycleCheckVisitor.visit(Vertex objectToVisit)
Override of superclass' visit() method. |
Constructors in salvo.jesus.graph with parameters of type Vertex | |
---|---|
CycleCheckVisitor(Vertex objectToCheck)
Creates a new instance of CheckCycleVisitor and specifies which Vertex to be checked for a cycle path |
|
DirectedEdgeImpl(Vertex sourceVertex,
Vertex sinkVertex)
Creates an DirectedEdgeImpl object whose origin and destination vertices are specified by the method parameters. |
|
DirectedEdgeWeakImpl(Vertex sourceVertex,
Vertex sinkVertex)
Creates an DirectedEdgeWeakImpl object whose origin and destination vertices are specified by the method parameters. |
|
EdgeImpl(Vertex a,
Vertex b)
Creates an UndirectedEdge object. |
|
GraphAddVertexEvent(java.lang.Object source,
Vertex newvertex)
Creates a GraphAddVertexEvent object indicating the source of the event and the Vertex that was added to a Graph object |
|
GraphRemoveVertexEvent(java.lang.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 |
Uses of Vertex in salvo.jesus.graph.algorithm |
---|
Methods in salvo.jesus.graph.algorithm with parameters of type Vertex | |
---|---|
java.util.Vector |
TopologicalSorting.reverseTraverse(Vertex startat)
Perform a reverse topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
java.util.Vector |
TopologicalSorting.traverse(Vertex startat)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
abstract java.util.Vector |
GraphTraversal.traverse(Vertex startat)
Abstract traversal method to be implemented by subclasses. |
java.util.Vector |
DepthFirstGraphTraversal.traverse(Vertex startat)
|
java.util.Vector |
DepthFirstDirectedGraphTraversal.traverse(Vertex startat)
|
java.util.Vector |
BreadthFirstTraversal.traverse(Vertex startat)
|
int |
TopologicalSorting.traverse(Vertex startat,
java.util.Vector visited,
Visitor visitor)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
abstract int |
GraphTraversal.traverse(Vertex startat,
java.util.Vector visited,
Visitor visitor)
Abstract traversal method to be implemented by subclasses. |
int |
DepthFirstGraphTraversal.traverse(Vertex startat,
java.util.Vector visited,
Visitor visitor)
|
int |
DepthFirstDirectedGraphTraversal.traverse(Vertex startat,
java.util.Vector visited,
Visitor visitor)
|
int |
BreadthFirstTraversal.traverse(Vertex startat,
java.util.Vector visited,
Visitor visitor)
|
java.util.Vector |
TopologicalSorting.traverse(Vertex startat,
Visitor visitor)
Perform a topological sort of the connected set of a directed acyclic graph to which Vertex startat belongs, starting at Vertex startat. |
abstract java.util.Vector |
GraphTraversal.traverse(Vertex startat,
Visitor visitor)
Abstract traversal method to be implemented by subclasses. |
java.util.Vector |
DepthFirstGraphTraversal.traverse(Vertex startat,
Visitor visitor)
|
java.util.Vector |
DepthFirstDirectedGraphTraversal.traverse(Vertex startat,
Visitor visitor)
|
java.util.Vector |
BreadthFirstTraversal.traverse(Vertex startat,
Visitor visitor)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |