Files
learnharness/scripts/replay-layout.ts
T
amosblomqvist 3a1c18b9de Inference-depth anchoring playground: vertical + radial modes
The graph's follows/supports edges encode derivation (premise ->
conclusion); the layout can now express that rank spatially, as a
session-only playground toggle (nothing promoted yet):

- inferenceDepths: longest chain from a base node, CYCLE-SAFE by
  SCC condensation (Tarjan, iterative) — the DAG property is typical,
  not guaranteed; cycle members share their component's depth (mutual
  support = equal footing). O(V+E), pure, deterministic.
- DepthAnchor force: per-node target scalar — vertical mode rows
  (baseline at the anchor centroid, arrows up), radial mode rings
  (foundations center, outer boundary = edge of knowledge). The rank
  is computed, not simulated: pairwise up-forces can't give baselines.
- Mode projections: gravity x-only in vertical / dropped in radial;
  cluster pull x-only in vertical / tangential-only in radial; the
  anchor re-blend preserves user arrangement in the FREE dimension
  only (x / angle) — meaning owns the constrained axis, memory owns
  the free one.
- setPhysicsTuning reheats (alpha 1): toggling a mode re-forms the
  graph live and commits the new rest state; drag release is springy
  along the constrained axis (node returns toward its level/ring).
- Sweep on the real graph: strength 0.8 = 215/216 arrows correct with
  organic sag; 1.5 = crisp rows. 174 base nodes, max chain depth 7,
  zero cycles in current data. replay-layout --depth=<mode> bakes a
  mode into the ledger for rest-state experiments.
2026-09-13 10:20:50 +03:00

116 lines
4.6 KiB
TypeScript

/**
* Option A simulation: replay the CURRENT graph through the incremental
* layout as if it had arrived one imported-notes file at a time — the
* organic growth path the user described (one dependency structure /
* cluster at a time, orphans collecting on the rim).
*
* Reads ONLY the ledgers (nodes / edges / mappings / sources); writes ONLY
* data/graph/positions.json — no LLM calls, no extraction, no chat records.
*
* npx tsx scripts/replay-layout.ts [--depth=vertical|radial]
*
* --depth regenerates the ledger WITH inference-depth anchoring (the
* playground mode baked into the rest state); omit it for the free layout.
*/
import { graphStore } from "../src/store/graph.ts";
import { detectCommunities } from "../src/core/clusters.ts";
// --depth=vertical|radial: bake the playground depth mode into the ledger.
const depthArg = process.argv.find((a) => a.startsWith("--depth="));
const depthMode: "off" | "vertical" | "radial" =
depthArg === "--depth=vertical" ? "vertical" : depthArg === "--depth=radial" ? "radial" : "off";
import { incrementalLayout } from "../src/core/layout.ts";
import type { GraphNode, NodeMapping, Position } from "../src/core/contracts.ts";
function main() {
const t0 = Date.now();
// Unique nodes (lines may repeat an id — first defines).
const seen = new Set<string>();
const nodes: GraphNode[] = [];
for (const line of graphStore.readNodes()) {
if (seen.has(line.id)) continue;
seen.add(line.id);
nodes.push(line);
}
const edges = graphStore.readEdges();
// Batches: each imported file, in real import order (sources.json
// importedAt). A node belongs to the file whose mapping first claims it
// (mapping line order = arrival); nodes no mapping covers (legacy) ride
// the final batch.
const sources = [...graphStore.readSources()].sort((a, b) => a.importedAt.localeCompare(b.importedAt));
const mappings: NodeMapping[] = graphStore.readMappings();
const batchOf = new Map<string, string>(); // nodeId → srcId
for (const m of mappings) {
if (!batchOf.has(m.graphNodeId)) batchOf.set(m.graphNodeId, m.chatId);
}
const delivered = new Set<string>();
let positions = new Map<string, Position>(Object.entries(graphStore.readPositions()));
if (positions.size > 0) {
console.log("[replay] discarding existing positions ledger — full replay from empty");
positions = new Map();
}
const byId = new Map(nodes.map((n) => [n.id, n]));
const unmappedFallback = sources[sources.length - 1]?.id ?? "";
console.log(`[replay] ${nodes.length} unique nodes, ${edges.length} edge lines, ${sources.length} sources`);
let maxOldShift = 0;
let shiftReport = "";
for (const source of sources) {
const batch = nodes.filter((n) => batchOf.get(n.id) === source.id);
const isLast = source.id === sources[sources.length - 1]!.id;
if (isLast) {
// Sweep in any never-mapped nodes with the last batch.
for (const n of nodes) {
if (!batchOf.has(n.id) && !delivered.has(n.id)) {
batch.push(n);
batchOf.set(n.id, unmappedFallback);
}
}
}
for (const n of batch) delivered.add(n.id);
// Edges activate once BOTH endpoints exist (a later file can claim
// one endpoint — the edge lights up then).
const activeEdges = edges.filter((e) => delivered.has(e.from) && delivered.has(e.to));
const before = new Map(positions);
const batchNodes = nodes.filter((n) => delivered.has(n.id));
positions = incrementalLayout(batchNodes, activeEdges, positions, {
// The same partition the real settle would see for this batch.
clusters: detectCommunities(batchNodes, activeEdges).communities,
...(depthMode === "off"
? {}
: {
depthAnchor: {
mode: depthMode,
strength: 0.8,
spacing: 60,
...(depthMode === "radial" ? { baseRadius: 220 } : {}),
},
}),
});
for (const [id, prev] of before) {
const now = positions.get(id)!;
const shift = Math.hypot(prev.x - now.x, prev.y - now.y);
if (shift > maxOldShift) {
maxOldShift = shift;
shiftReport = `${id} ${prev.x.toFixed(0)},${prev.y.toFixed(0)} -> ${now.x.toFixed(0)},${now.y.toFixed(0)} (batch ${batch.length} new, ${activeEdges.length} edges)`;
}
}
const label = source.filePath.split("/").pop() ?? source.id;
console.log(
`[replay] +${String(batch.length).padStart(3)} nodes ${String(activeEdges.length).padStart(4)} edges active (${label})`,
);
}
graphStore.writePositions(Object.fromEntries(positions));
console.log(
`[replay] done: ${positions.size} positions written in ${((Date.now() - t0) / 1000).toFixed(1)}s` +
` (max old-node shift within a batch: ${maxOldShift.toFixed(1)}: ${shiftReport})`,
);
}
main();