SILVER/NODEDC_1C
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Planner Autonomy: выбрать comparison chain для явного bidirectional graph

Browse Source
This commit is contained in:
dctouch
2026-05-01 14:20:24 +03:00
parent 1c1383b8b5
commit ea96df9ca1
5 changed files with 27 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files
llm_normalizer/backend/src/services/assistantMcpDiscoveryPlanner.ts
+5 -2
View File
@@ -703,16 +703,19 @@ function recipeFor(input: AssistantMcpDiscoveryPlannerInput): PlannerRecipe {
}
if (graphFactFamily === "value_flow") {
if (dataNeedGraph?.comparison_need === "incoming_vs_outgoing" && !hasSubjectCandidates(dataNeedGraph)) {
if (dataNeedGraph?.comparison_need === "incoming_vs_outgoing") {
pushUnique(axes, "amount");
pushUnique(axes, "coverage_target");
if (requestedAggregationAxis === "month" || graphAggregation === "by_month") {
pushUnique(axes, "calendar_month");
}
const template = getAssistantMcpCatalogChainTemplate("value_flow_comparison");
const fallbackPrimitives = hasSubjectCandidates(dataNeedGraph)
? (["resolve_entity_reference", ...template.fallback_primitives] as AssistantMcpDiscoveryPrimitive[])
: template.fallback_primitives;
const primitiveSelection = selectPrimitivesFromGraphAndCatalog({
dataNeedGraph,
fallbackPrimitives: template.fallback_primitives,
fallbackPrimitives,
requiredAxes: axes,
metadataSurface: input.metadataSurface,
actionFamily: action,