@tabularis/explain 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Andrea Debernardi
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,104 @@
+# @tabularis/explain
+
+Analyse and visualise a database EXPLAIN plan.
+
+Takes a plan that has *already* been produced and derives everything from it:
+per-node exclusive metrics, diagnostics, statistics, and React views. It never
+connects to a database, builds an `EXPLAIN` statement, or runs a query.
+
+## Entry points
+
+| Import | Contains | Runtime deps |
+|---|---|---|
+| `@tabularis/explain` | plan types, metrics, diagnostics, stats, formatters, tree helpers | **none** |
+| `@tabularis/explain/react` | the views: graph, table, diagram, stats, node details, bars | react, react-i18next, @xyflow/react, dagre, clsx, lucide-react |
+| `@tabularis/explain/flow` | ReactFlow node/edge adapter + dagre layout | @xyflow/react, dagre |
+
+The core entry point has **no runtime dependencies at all**, so plan analysis can
+run anywhere — a browser, a worker, a Node script, a test.
+
+```ts
+import {
+  computeExplainMetrics,
+  getPlanDiagnostics,
+  getExplainPlanSummary,
+} from "@tabularis/explain";
+
+const metrics = computeExplainMetrics(plan);
+const diagnostics = getPlanDiagnostics(plan, metrics);
+const summary = getExplainPlanSummary(plan, metrics);
+```
+
+```tsx
+import { ExplainGraph, ExplainTableView } from "@tabularis/explain/react";
+
+<ExplainGraph
+  plan={plan}
+  metrics={metrics}
+  diagnostics={diagnostics}
+  selectedNodeId={selectedNodeId}
+  onSelectNode={setSelectedNodeId}
+/>;
+```
+
+## Where a plan comes from
+
+This package never runs a query — it turns *already-produced* EXPLAIN output
+into an `ExplainPlan` and analyses it. The parsers cover Postgres
+`EXPLAIN (FORMAT JSON)` and text output, MySQL/MariaDB `FORMAT=JSON`,
+`EXPLAIN ANALYZE` / `ANALYZE FORMAT=TEXT` trees and decoded tabular rows, and
+SQLite `EXPLAIN QUERY PLAN` rows:
+
+```ts
+import { parseExplain, parseExplainFor, parseRawExplain } from "@tabularis/explain";
+
+// Sniff the format of a pasted blob or an uploaded file:
+const plan = parseExplain(raw);
+
+// Or name the engine when the caller knows it:
+const hinted = parseExplainFor(raw, "mysql");
+
+// Or parse the raw payload a host driver handed over:
+const fromDriver = parseRawExplain({ engine, format, payload, original_query });
+```
+
+A host obtains the bytes however it likes — a driver, a pasted textarea, an
+uploaded file — and hands them over untouched. Drivers for engines these
+parsers do not know (plugin drivers) supply a fully-parsed `ExplainPlan`
+instead; both shapes flow through `resolveExplainOutput`.
+
+## Host requirements for the React entry point
+
+The views are presentational but not self-contained. A host must provide:
+
+- **Tailwind**, with the same colour tokens the desktop app uses — components
+  emit utility class names rather than scoped CSS;
+- **an initialised `react-i18next` instance** exposing the
+  `editor.visualExplain.*` key namespace. The keys deliberately stay with the
+  host's translation catalogue rather than being bundled here;
+- **`@xyflow/react`'s stylesheet**, if `ExplainGraph` is used.
+
+## Deliberately not included
+
+- Running `EXPLAIN`, or deciding whether a statement can be explained
+  (`isExplainableQuery` / `isDataModifyingQuery` are host SQL concerns).
+- Any Tauri, IPC or transport call.
+- The AI plan explanation, which is a host feature backed by a host-configured
+  provider.
+- The raw-output tab, which the desktop app renders with Monaco and its own
+  theme system.
+
+The last two are why the desktop app keeps its own `VisualExplainView`
+composition: it wires those host pieces around the components exported here.
+
+## Development
+
+```bash
+pnpm --filter @tabularis/explain typecheck
+pnpm --filter @tabularis/explain build     # tsup → dist, for publishing
+pnpm vitest run packages/explain           # tests run from the repo root
+```
+
+Workspace consumers resolve the entry points straight to TypeScript source, so
+no build step is needed during development; `publishConfig` swaps in `dist` when
+the package is published.

package/dist/diagnostics-DPSgsjFk.d.ts

@@ -0,0 +1,157 @@
+interface ExplainNode {
+    id: string;
+    node_type: string;
+    relation: string | null;
+    startup_cost: number | null;
+    total_cost: number | null;
+    plan_rows: number | null;
+    actual_rows: number | null;
+    actual_time_ms: number | null;
+    actual_loops: number | null;
+    buffers_hit: number | null;
+    buffers_read: number | null;
+    filter: string | null;
+    index_condition: string | null;
+    join_type: string | null;
+    hash_condition: string | null;
+    extra: Record<string, unknown>;
+    children: ExplainNode[];
+}
+interface ExplainPlan {
+    root: ExplainNode;
+    planning_time_ms: number | null;
+    execution_time_ms: number | null;
+    original_query: string;
+    driver: string;
+    has_analyze_data: boolean;
+    raw_output: string | null;
+}
+
+/**
+ * Per-node metrics derived from a plan tree.
+ *
+ * The values reported by the database are *inclusive* and, for timings, are
+ * *averages per loop*:
+ *
+ * - `Total Cost` covers the node and everything below it.
+ * - `Actual Total Time` covers the node and everything below it, averaged over
+ *   `Actual Loops` iterations.
+ *
+ * Using those numbers directly makes the plan root look like the most expensive
+ * and slowest node in every plan, which hides the real bottleneck. The metrics
+ * below restate them as totals across loops and as *exclusive* (self) values,
+ * which is what the views highlight.
+ */
+interface ExplainNodeMetrics {
+    nodeId: string;
+    /** 1-based depth-first position. Used as the node label across all views. */
+    index: number;
+    /** Nesting level, 0 for the plan root. */
+    depth: number;
+    /** Time in this node and its children, summed over every loop. */
+    inclusiveTimeMs: number | null;
+    /** Time in this node alone, summed over every loop. */
+    exclusiveTimeMs: number | null;
+    /** Planner cost of this node and its children. */
+    totalCost: number | null;
+    /** Planner cost attributable to this node alone. */
+    exclusiveCost: number | null;
+    /** Rows produced across every loop. */
+    totalRows: number | null;
+    /** Shared buffers touched by this node and its children. */
+    inclusiveBuffers: number | null;
+    /** Shared buffers touched by this node alone. */
+    exclusiveBuffers: number | null;
+    /** `exclusiveTimeMs` as a fraction of the whole plan, 0..1. */
+    timeShare: number | null;
+    /** The planner produced the node but the executor never ran it. */
+    neverExecuted: boolean;
+}
+interface ExplainMetrics {
+    byId: Map<string, ExplainNodeMetrics>;
+    /** Depth-first order, matching the `index` field. */
+    order: ExplainNodeMetrics[];
+    maxExclusiveTimeMs: number;
+    maxExclusiveCost: number;
+    maxTotalRows: number;
+    maxExclusiveBuffers: number;
+    /** Sum of every node's exclusive time, i.e. the whole plan's execution time. */
+    totalExclusiveTimeMs: number;
+}
+/** Metric a bar chart or heat map can be driven by. */
+type ExplainMetricKind = "time" | "rows" | "cost" | "buffers";
+declare const EXPLAIN_METRIC_KINDS: readonly ExplainMetricKind[];
+/** Compute exclusive/total metrics for every node in `plan`. */
+declare function computeExplainMetrics(plan: ExplainPlan): ExplainMetrics;
+/** Metrics for a single node, or `null` when the id is unknown. */
+declare function getNodeMetrics(metrics: ExplainMetrics, nodeId: string | null): ExplainNodeMetrics | null;
+/** The value a given metric contributes for one node. */
+declare function getMetricValue(metrics: ExplainNodeMetrics, kind: ExplainMetricKind): number | null;
+/** The largest value of a given metric across the plan. */
+declare function getMetricMax(metrics: ExplainMetrics, kind: ExplainMetricKind): number;
+/** Whether any node in the plan carries data for a given metric. */
+declare function isMetricAvailable(metrics: ExplainMetrics, kind: ExplainMetricKind): boolean;
+/** Metrics that carry data, in display order. */
+declare function getAvailableMetricKinds(metrics: ExplainMetrics): ExplainMetricKind[];
+/**
+ * Metric the heat map and diagram default to: measured time when the plan was
+ * run with ANALYZE, planner cost otherwise. `null` when the plan carries no
+ * metric at all, so callers never select a metric that has no data.
+ */
+declare function getDefaultMetricKind(metrics: ExplainMetrics): ExplainMetricKind | null;
+
+type ExplainDiagnosticKind = "hotspot" | "over-estimate" | "under-estimate" | "disk-sort" | "filter-loss" | "large-seq-scan" | "heap-fetches" | "workers-underused" | "high-loops" | "cache-miss" | "never-executed";
+type ExplainDiagnosticSeverity = "info" | "warning" | "critical";
+interface ExplainDiagnostic {
+    kind: ExplainDiagnosticKind;
+    severity: ExplainDiagnosticSeverity;
+    /** i18n key for the short chip label. */
+    labelKey: string;
+    /** i18n key for the one-line explanation shown in the node details. */
+    descriptionKey: string;
+    /** Pre-formatted figure shown next to the label, when the check has one. */
+    value?: string;
+}
+/**
+ * Thresholds every check is calibrated against. Exported so tests pin the
+ * boundaries rather than duplicating the numbers.
+ */
+declare const EXPLAIN_DIAGNOSTIC_THRESHOLDS: {
+    /** Share of total plan time above which a node is called a hotspot. */
+    readonly hotspotTimeShare: 0.25;
+    /** Nodes faster than this never count as a hotspot, however large the share. */
+    readonly hotspotMinTimeMs: 1;
+    /** Row estimate off by this factor is a warning. */
+    readonly estimateWarnFactor: 4;
+    /** Row estimate off by this factor is critical. */
+    readonly estimateCriticalFactor: 10;
+    /** Estimate checks are skipped below this many actual rows, to cut noise. */
+    readonly estimateMinRows: 10;
+    /** Fraction of scanned rows dropped by a filter that counts as wasted work. */
+    readonly filterLossRatio: 0.9;
+    /** Filter checks are skipped below this many discarded rows. */
+    readonly filterLossMinRows: 1000;
+    /** Sequential scans below this many rows are not reported. */
+    readonly seqScanMinRows: 10000;
+    /** Heap fetches above this count suggest the visibility map is stale. */
+    readonly heapFetchesMinCount: 1000;
+    /** Loop count above which repeated execution is worth pointing out. */
+    readonly highLoopsMinCount: 1000;
+    /** Fraction of buffer accesses that missed shared buffers. */
+    readonly cacheMissRatio: 0.5;
+    /** Cache checks are skipped below this many blocks read from disk. */
+    readonly cacheMissMinBlocks: 1000;
+};
+/**
+ * Checks that apply to a single node. `metrics` is optional so a node can be
+ * inspected without a full plan walk; the hotspot check is skipped without it.
+ */
+declare function getNodeDiagnostics(node: ExplainNode, metrics?: ExplainNodeMetrics | null): ExplainDiagnostic[];
+/** Diagnostics for every node in the plan, keyed by node id. */
+declare function getPlanDiagnostics(plan: ExplainPlan, metrics: ExplainMetrics): Map<string, ExplainDiagnostic[]>;
+/** Highest severity in a list, or `null` when the list is empty. */
+declare function getWorstSeverity(diagnostics: ExplainDiagnostic[]): ExplainDiagnosticSeverity | null;
+/** How many diagnostics of each severity the whole plan produced. */
+declare function countDiagnosticsBySeverity(diagnostics: Map<string, ExplainDiagnostic[]>): Record<ExplainDiagnosticSeverity, number>;
+
+export { type ExplainPlan as E, type ExplainNode as a, type ExplainMetrics as b, EXPLAIN_DIAGNOSTIC_THRESHOLDS as c, EXPLAIN_METRIC_KINDS as d, type ExplainDiagnostic as e, type ExplainDiagnosticKind as f, type ExplainDiagnosticSeverity as g, type ExplainMetricKind as h, type ExplainNodeMetrics as i, computeExplainMetrics as j, countDiagnosticsBySeverity as k, getAvailableMetricKinds as l, getDefaultMetricKind as m, getMetricMax as n, getMetricValue as o, getNodeDiagnostics as p, getNodeMetrics as q, getPlanDiagnostics as r, getWorstSeverity as s, isMetricAvailable as t };

package/dist/flow.d.ts

@@ -0,0 +1,40 @@
+import { Node, Edge } from '@xyflow/react';
+import { a as ExplainNode, i as ExplainNodeMetrics, e as ExplainDiagnostic, E as ExplainPlan, b as ExplainMetrics } from './diagnostics-DPSgsjFk.js';
+
+/**
+ * ReactFlow adapter: turns a plan tree into positioned nodes and edges.
+ *
+ * Split out of `plan.ts` so the analysis core stays free of `@xyflow/react` and
+ * `dagre` — a headless consumer never pulls a graph library.
+ */
+
+/** Payload carried by every `explainPlan` node in the ReactFlow graph. */
+interface ExplainPlanNodeData extends Record<string, unknown> {
+    node: ExplainNode;
+    metrics: ExplainNodeMetrics | null;
+    /** Largest exclusive cost in the plan, used to scale the heat colour. */
+    maxExclusiveCost: number;
+    /** Largest exclusive time in the plan, used to scale the heat colour. */
+    maxExclusiveTimeMs: number;
+    diagnostics: ExplainDiagnostic[];
+    hasAnalyzeData: boolean;
+    isSelected: boolean;
+}
+/**
+ * Build the ReactFlow graph for a plan.
+ *
+ * `metrics` and `diagnostics` may be supplied by a caller that already computed
+ * them for other views, so a plan is only walked once per render. Diagnostics
+ * are passed in rather than derived here, which keeps this module independent of
+ * `explainDiagnostics` — that module needs the helpers below.
+ */
+declare function explainPlanToFlow(plan: ExplainPlan, selectedNodeId?: string | null, metrics?: ExplainMetrics, diagnostics?: Map<string, ExplainDiagnostic[]>): {
+    nodes: Node[];
+    edges: Edge[];
+};
+declare function layoutExplainNodes(nodes: Node[], edges: Edge[]): {
+    nodes: Node[];
+    edges: Edge[];
+};
+
+export { type ExplainPlanNodeData, explainPlanToFlow, layoutExplainNodes };

package/dist/flow.js

@@ -0,0 +1,171 @@
+import dagre from 'dagre';
+
+// src/flow.ts
+
+// src/metrics.ts
+function loopCount(node) {
+  return node.actual_loops != null && node.actual_loops > 0 ? node.actual_loops : 1;
+}
+function isSubplanChild(node) {
+  const relationship = node.extra["Parent Relationship"];
+  return relationship === "InitPlan" || relationship === "SubPlan";
+}
+function bufferCount(node) {
+  if (node.buffers_hit == null && node.buffers_read == null) {
+    return null;
+  }
+  return (node.buffers_hit ?? 0) + (node.buffers_read ?? 0);
+}
+function selfValue(total, childSum) {
+  if (total == null) {
+    return null;
+  }
+  return Math.max(0, total - childSum);
+}
+function computeExplainMetrics(plan) {
+  const byId = /* @__PURE__ */ new Map();
+  const order = [];
+  let nextIndex = 1;
+  function walk(node, depth) {
+    const metrics = {
+      nodeId: node.id,
+      index: nextIndex,
+      depth,
+      inclusiveTimeMs: null,
+      exclusiveTimeMs: null,
+      totalCost: node.total_cost,
+      exclusiveCost: null,
+      totalRows: null,
+      inclusiveBuffers: bufferCount(node),
+      exclusiveBuffers: null,
+      timeShare: null,
+      neverExecuted: node.actual_loops === 0
+    };
+    nextIndex += 1;
+    byId.set(node.id, metrics);
+    order.push(metrics);
+    let childTimeMs = 0;
+    let childCost = 0;
+    let childBuffers = 0;
+    for (const child of node.children) {
+      const contribution = walk(child, depth + 1);
+      childCost += contribution.cost;
+      childBuffers += contribution.buffers;
+      if (!isSubplanChild(child)) {
+        childTimeMs += contribution.timeMs;
+      }
+    }
+    const loops = loopCount(node);
+    metrics.inclusiveTimeMs = node.actual_time_ms != null ? node.actual_time_ms * loops : null;
+    metrics.exclusiveTimeMs = selfValue(metrics.inclusiveTimeMs, childTimeMs);
+    metrics.exclusiveCost = selfValue(metrics.totalCost, childCost);
+    metrics.exclusiveBuffers = selfValue(metrics.inclusiveBuffers, childBuffers);
+    metrics.totalRows = node.actual_rows != null ? node.actual_rows * loops : null;
+    return {
+      timeMs: metrics.inclusiveTimeMs ?? 0,
+      cost: metrics.totalCost ?? 0,
+      buffers: metrics.inclusiveBuffers ?? 0
+    };
+  }
+  walk(plan.root, 0);
+  let maxExclusiveTimeMs = 0;
+  let maxExclusiveCost = 0;
+  let maxTotalRows = 0;
+  let maxExclusiveBuffers = 0;
+  let totalExclusiveTimeMs = 0;
+  for (const metrics of order) {
+    maxExclusiveTimeMs = Math.max(
+      maxExclusiveTimeMs,
+      metrics.exclusiveTimeMs ?? 0
+    );
+    maxExclusiveCost = Math.max(maxExclusiveCost, metrics.exclusiveCost ?? 0);
+    maxTotalRows = Math.max(maxTotalRows, metrics.totalRows ?? 0);
+    maxExclusiveBuffers = Math.max(
+      maxExclusiveBuffers,
+      metrics.exclusiveBuffers ?? 0
+    );
+    totalExclusiveTimeMs += metrics.exclusiveTimeMs ?? 0;
+  }
+  if (totalExclusiveTimeMs > 0) {
+    for (const metrics of order) {
+      if (metrics.exclusiveTimeMs != null) {
+        metrics.timeShare = metrics.exclusiveTimeMs / totalExclusiveTimeMs;
+      }
+    }
+  }
+  return {
+    byId,
+    order,
+    maxExclusiveTimeMs,
+    maxExclusiveCost,
+    maxTotalRows,
+    maxExclusiveBuffers,
+    totalExclusiveTimeMs
+  };
+}
+
+// src/flow.ts
+function explainPlanToFlow(plan, selectedNodeId, metrics, diagnostics) {
+  const planMetrics = metrics ?? computeExplainMetrics(plan);
+  const rawNodes = [];
+  const edges = [];
+  function walk(node) {
+    const nodeMetrics = planMetrics.byId.get(node.id);
+    const data = {
+      node,
+      metrics: nodeMetrics ?? null,
+      maxExclusiveCost: planMetrics.maxExclusiveCost,
+      maxExclusiveTimeMs: planMetrics.maxExclusiveTimeMs,
+      diagnostics: diagnostics?.get(node.id) ?? [],
+      hasAnalyzeData: plan.has_analyze_data,
+      isSelected: selectedNodeId === node.id
+    };
+    rawNodes.push({
+      id: node.id,
+      type: "explainPlan",
+      position: { x: 0, y: 0 },
+      data
+    });
+    for (const child of node.children) {
+      edges.push({
+        id: `${node.id}-${child.id}`,
+        source: node.id,
+        target: child.id,
+        animated: true,
+        style: { stroke: "#6366f1" }
+      });
+      walk(child);
+    }
+  }
+  walk(plan.root);
+  return layoutExplainNodes(rawNodes, edges);
+}
+function layoutExplainNodes(nodes, edges) {
+  const g = new dagre.graphlib.Graph();
+  g.setDefaultEdgeLabel(() => ({}));
+  g.setGraph({ rankdir: "TB", ranksep: 80, nodesep: 40 });
+  const NODE_WIDTH = 280;
+  for (const node of nodes) {
+    const data = node.data;
+    const lines = 3 + (data.hasAnalyzeData ? 2 : 0) + (data.node.filter ? 1 : 0) + (data.diagnostics.length > 0 ? 1 : 0);
+    const height = 28 + lines * 22;
+    g.setNode(node.id, { width: NODE_WIDTH, height });
+  }
+  for (const edge of edges) {
+    g.setEdge(edge.source, edge.target);
+  }
+  dagre.layout(g);
+  const layoutedNodes = nodes.map((node) => {
+    const pos = g.node(node.id);
+    return {
+      ...node,
+      position: {
+        x: pos.x - NODE_WIDTH / 2,
+        y: pos.y - pos.height / 2
+      }
+    };
+  });
+  return { nodes: layoutedNodes, edges };
+}
+
+export { explainPlanToFlow, layoutExplainNodes };