reqlanOverviewIdeasFilesCode filesClustersAttributesGraphPrint

Idea detail

path_query

reqlan rq/extension/module/graph-path.rq:17

block

Summary

Inputs:
- `fromIdeaId` ( source node )
- `toIdeaId` ( target node )
- optional `maxDepth` ( default 8 )
- optional `edgeKinds` filter ( references, file_reference, incompatible, … )
- optional `direction` ( undirected default, or outbound-only / inbound-only for directed traces )
Output: path_result — zero or more shortest paths through the indexed graph, capped for token and UI limits.

Jump to outbound references

Jump to inbound references

Navigation

Source file

reqlan rq/extension/module/graph-path.rq

 community 26

community cluster

graph-path.rq

file cluster

reqlan rq/extension/module

folder cluster

status: Not present

status cluster

tag: Not present

tag cluster

 Printable page

Static print-friendly idea sheet.

Ancestor context

path_result

- `found`: boolean - `paths`: ordered list of [graph_path] ( typically top 1 – 3 shortest ) - `truncated`: true when search hit depth or branch limits - `summaryLine`: e. g. " A → implements → B → depends on → C " for collapsed UI

graph_path

Ordered nodes and edges from source to target. Each step records idea id, name, status, edge kind, and optional snippet / line for the traversed edge. Paths with unresolved hops are marked broken; UI offers jump-to-source like [activitybar.reference_lists_pane].