Package | Description |
---|---|
com.tietoenator.trip.jxp.graph |
[EXPERIMENTAL] Graph database querying and manipulation.
|
Modifier and Type | Class and Description |
---|---|
class |
TdbSubGraph
Represents a graph database search result.
|
Modifier and Type | Method and Description |
---|---|
TdbGraphSet |
TdbGraphSet.backtrack(java.lang.String edge,
int sourceSet)
Creates a subgraph by following a particular edge type backwards
from target vertex in the current graph set to source vertex in
the specified source set.
|
TdbGraphSet |
TdbGraphSet.follow(java.lang.String edge,
int targetSet)
Creates a subgraph by locating targets for the source vertices
in the current graph set such that they are related via a particular
edge (a.k.a.
|
TdbGraphSet |
TdbGraph.getGraphSet()
Returns the graph set associated with the entire graph database
or cluster associated with this TdbGraph instance.
|
TdbGraphSet |
TdbGraphSet.merge(TdbGraphSet otherSet)
Merge this graph set with another, producing the union of both sets.
|
TdbGraphSet |
TdbGraphSet.source(int searchSet)
Create a subgraph with edges where source vertices can be found
in the specified (regular) search set.
|
TdbGraphSet |
TdbGraphSet.target(int searchSet)
Create a subgraph with edges where target vertices can be found
in the specified (regular) search set.
|
TdbGraphSet |
TdbGraphQueryResult.toGraphSet()
Returns a TdbGraphSet object for this query result if and only if
the result contains graph edges.
|
TdbGraphSet |
TdbGraphSet.transitive(int sourceSet,
int targetSet,
java.lang.String[] edgeNames,
int maxDepth,
boolean reverse,
boolean allEdges)
Creates a subgraph of the current graph set where the specified source
and target records are connected via path.
|
Modifier and Type | Method and Description |
---|---|
TdbGraphSet |
TdbGraphSet.merge(TdbGraphSet otherSet)
Merge this graph set with another, producing the union of both sets.
|