Cluster detail
community 26
Computed connectivity cluster from the reference graph.
community
4 ideas
1 files
| Idea | File | Status | Summary |
|---|---|---|---|
| graph_path | reqlan rq/extension/module/graph-path.rq | 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]. | |
| implementation_notes | reqlan rq/extension/module/graph-path.rq | Analytical: add `findPathsBetween(store, fromId, toId, options)` returning [path_result]. Wire: new `loadGraphPath` message alongside existing `loadGraph` / `loadAncestors`. UI: defer dedicated pane until [activitybar.selection_pane] and composed context are stable; prototype in Ideas Summary graph tab first. | |
| path_query | reqlan rq/extension/module/graph-path.rq | 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. | |
| path_result | reqlan rq/extension/module/graph-path.rq | - `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 |
Initialising graph…