Traversee du Graphe

Traverses the ontology graph starting from an entity by following relationships. Returns the complete path and visited nodes.

Parameters

Parameter	Type	Required	Variable	Description
startEntityId	dynamic value	Yes	Yes	Starting entity identifier for the graph traversal.
maxDepth	number	No	No	Maximum traversal depth (1 to 5). (Default: 3, min 1, max 5)
direction	choice (outbound, inbound, any)	No	No	Traversal direction: outbound, inbound, or any. (Default: "outbound")
edgeTypes	array	No	No	Filter by edge types to follow (empty = all).
mode	choice (bfs, dfs)	No	No	Traversal algorithm: breadth-first (BFS) or depth-first (DFS). (Default: "bfs")
pathMode	choice (all, shortest, weighted)	No	No	Path finding mode: all paths, shortest, or weighted.
maxPaths	number	No	No	Maximum number of paths to return. (min 1, max 100)
detectCycles	boolean	No	No	Enable cycle detection in the graph. (Default: false)
includeEdgeData	boolean	No	No	Include edge data in the results. (Default: false)
outputVariable	text	No	No	Output variable name containing the traversal results.

Parameters marked Variable = Yes accept the {{blockName.field}} syntax.

Output

Output variable : traversalResult

{
  "path": [],
  "nodes": []
}

Example

Traverse the graph from a supplier.

Input :

{"startEntityId": "supplier-123"}

Output :

{"path": ["supplier-123", "contract-1", "project-A"], "nodes": [{"id": "supplier-123"}, {"id": "contract-1"}, {"id": "project-A"}]}

Tip

{{traversalResult.path}} is an ordered array of IDs. maxDepth limits the depth (default 3). Useful for impact analysis and dependencies.