amosblomqvist
975a78a304
The 'virtual node' realized as a centroid force: two allocation-free O(n) passes per tick (membership resolved once at sim creation; Float64Array sums). Measured indistinguishable from force-off at 338 nodes (271ms vs 272ms per 400-tick settle). - createGraphSimulation: SimOptions.clusterPull + linkStrength + velocityDecay (physics controls plumbing); degree-scaled link stiffness so linkStrength=1 is exactly d3's default - settleGraphLayout split into layout-settle.ts (it computes the Louvain partition for the pull); layout.ts stays browser-barrel-pure - barrel no longer re-exports clusters.ts: graphology + louvain are fully out of the client bundle (verified against built chunks) - replay passes the per-batch partition; CLUSTER_PULL_STRENGTH=0.15 tuned by sweep: cluster spread 63->36 world units, centroid separation and total span unchanged (no blob merge, no collapse)
43 lines
1.9 KiB
TypeScript
43 lines
1.9 KiB
TypeScript
import type { GraphEdge, GraphNode } from "./contracts.ts";
|
|
import { detectCommunities } from "./clusters.ts";
|
|
import { incrementalLayout } from "./layout.ts";
|
|
import type { Position } from "./contracts.ts";
|
|
|
|
/**
|
|
* The merge-time settle: recompute the resting layout from the CURRENT
|
|
* graph + the positions ledger, and replace the ledger. Called by the
|
|
* extraction pipeline after every merge (the sole writer) and by the
|
|
* positions-commit endpoint when the graph grew under a live-physics
|
|
* commit (client positions become the anchor set). Synchronous — it must
|
|
* finish before the next /api/graph fetch reflects the change.
|
|
*
|
|
* SPLIT FROM layout.ts deliberately (2026-09-13): layout.ts is in the
|
|
* browser barrel, and the settle needs the Louvain partition for the
|
|
* cluster centroid pull — graphology-louvain must not ship in the client
|
|
* bundle. Server code imports this module DIRECTLY; it is never
|
|
* re-exported through src/core/index.ts.
|
|
*/
|
|
export function settleGraphLayout(graphStore: {
|
|
readNodes(): GraphNode[];
|
|
readEdges(): GraphEdge[];
|
|
readPositions(): Record<string, Position>;
|
|
writePositions(positions: Record<string, Position>): void;
|
|
}): void {
|
|
const nodes = graphStore.readNodes();
|
|
if (nodes.length === 0) return;
|
|
// Node LINES may repeat an id (link-appends) — dedupe, first defines.
|
|
const seen = new Set<string>();
|
|
const unique = nodes.filter((n) => {
|
|
if (seen.has(n.id)) return false;
|
|
seen.add(n.id);
|
|
return true;
|
|
});
|
|
const edges = graphStore.readEdges();
|
|
const previous = new Map(Object.entries(graphStore.readPositions()));
|
|
// The cluster partition for the centroid pull: same Louvain the
|
|
// snapshot uses (same nodes/edges = same communities). 338 nodes:
|
|
// ~1-2ms, noise next to the settle itself.
|
|
const { communities } = detectCommunities(unique, edges);
|
|
const next = incrementalLayout(unique, edges, previous, { clusters: communities });
|
|
graphStore.writePositions(Object.fromEntries(next));
|
|
} |