Abstract class for all algorithms based on deep search first.
This class is designed in accordance with the Template Method pattern.
The basic algorithm (implemented in the method
GraphProcessor.process ) reads:
vertex.visit();
processBefore(vertex);
for (int i = 0, n = vertex.getNumberOfOutgoingArcs(); i < n; i++) {
processArc(vertex, vertex.getHeadVertex(i));
}
processAfter(vertex);
The base class for any type of vertex in a directed graph.
A Vertex holds an
Attributes object which encapsulates
all properties of the vertex which are not necessary to know for
parsing a graph in a
GraphProcessor .