| Package | Description |
|---|---|
| org.corpus_tools.salt.core | |
| org.corpus_tools.salt.core.impl | |
| org.corpus_tools.salt.util.internal.persistence.dot |
| Modifier and Type | Method and Description |
|---|---|
static SGraph.GRAPH_TRAVERSE_TYPE |
SGraph.GRAPH_TRAVERSE_TYPE.valueOf(String name)
Returns the enum constant of this type with the specified name.
|
static SGraph.GRAPH_TRAVERSE_TYPE[] |
SGraph.GRAPH_TRAVERSE_TYPE.values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
GraphTraverseHandler.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order)
This method is called during a traversal to check if the current node and
eventually its sub-graph shall be traversed or not.
|
void |
GraphTraverseHandler.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is left, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and the method
#nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
has been invoked. |
void |
GraphTraverseHandler.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order)
This method will be invoked, when a node is reached, after the method
#checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long)
has returned true and before the method
#nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long)
is invoked. |
void |
SGraph.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Attention: When isCycleSafe is set to false, this
method does not take care about cycles, and it eventually runs into
endless loops.
|
void |
SGraph.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
| Modifier and Type | Method and Description |
|---|---|
void |
GraphTraverserModule.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
void |
SGraphImpl.traverse(List<? extends SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler,
boolean isCycleSafe)
Attention: When isCycleSafe is set to false, this
method does not take care about cycles, and it eventually runs into
endless loops.
|
void |
GraphTraverserModule.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
void |
SGraphImpl.traverse(List<SNode> startNodes,
SGraph.GRAPH_TRAVERSE_TYPE traverseType,
String traverseId,
GraphTraverseHandler traverseHandler)
Traverses a graph in the given order traverseType and starts traversing
with the given startNodes.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
SDocumentGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation<SNode,SNode> relation,
SNode currNode,
long order) |
boolean |
SCorpusGraphDOTWriter.checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SRelation edge,
SNode currNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation<SNode,SNode> relation,
SNode fromNode,
long order) |
void |
SCorpusGraphDOTWriter.nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation edge,
SNode fromNode,
long order) |
void |
SCorpusGraphDOTWriter.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currSNode,
SRelation relation,
SNode fromSNode,
long order) |
void |
SDocumentGraphDOTWriter.nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
String traversalId,
SNode currNode,
SRelation relation,
SNode fromNode,
long order) |
Copyright © 2009–2015 Humboldt-Universität zu Berlin, INRIA. All rights reserved.