|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Visitor | |
---|---|
laas.friends.cosmopen.graphAnalysis | This package provides the internal graph manipulation engine. |
salvo.jesus.graph | |
salvo.jesus.graph.algorithm |
Uses of Visitor in laas.friends.cosmopen.graphAnalysis |
---|
Classes in laas.friends.cosmopen.graphAnalysis that implement Visitor | |
---|---|
private class |
DirectedGraphWithDictImpl.ExtractingVisitor_
This class is a visitor for the travsersal of directed graph which add the outgoing adjacent vertices and the corresponding edges for each visited vertex to a resulting extrated graph under work passed at construction. |
Methods in laas.friends.cosmopen.graphAnalysis with parameters of type Visitor | |
---|---|
int |
BFMultiStartDirectedGraphTraversal.traverse(NamedVertex[] startatVertices,
java.util.Vector visited,
Visitor visitor)
|
java.util.Vector |
BFMultiStartDirectedGraphTraversal.traverse(NamedVertex[] startatS,
Visitor visitor)
|
Uses of Visitor in salvo.jesus.graph |
---|
Classes in salvo.jesus.graph that implement Visitor | |
---|---|
(package private) class |
CycleCheckVisitor
This is a non-public class the extends salvo.jesus.graph.Vistor to check if there is a cycle from a Vertex back to itself. |
class |
NullVisitor
A visitor that always return true when visiting. |
(package private) class |
StopAtVisitor
A Visitor that notifies a traversal to stop at a particular Vertex. |
Uses of Visitor in salvo.jesus.graph.algorithm |
---|
Methods in salvo.jesus.graph.algorithm with parameters of type Visitor | |
---|---|
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 |