@caoguo/maplibre-pipeline 0.0.2 → 0.0.4

package/dist/chunk-GCDA7KJM.js

@@ -0,0 +1,289 @@
+// src/graph/adjacency.ts
+function buildAdjacency(dataset) {
+  const adj = /* @__PURE__ */ new Map();
+  for (const node of dataset.nodes) {
+    if (!adj.has(node.id)) adj.set(node.id, []);
+  }
+  for (const pipe of dataset.pipes) {
+    const len = pipe.length ?? pipeLengthFromGeometry(pipe, dataset.nodes) ?? 0;
+    const fromList = adj.get(pipe.fromNode) ?? [];
+    fromList.push({
+      pipeId: pipe.id,
+      to: pipe.toNode,
+      length: len
+    });
+    adj.set(pipe.fromNode, fromList);
+    const toList = adj.get(pipe.toNode) ?? [];
+    toList.push({
+      pipeId: pipe.id,
+      to: pipe.fromNode,
+      length: len
+    });
+    adj.set(pipe.toNode, toList);
+  }
+  return adj;
+}
+function pipeLengthFromGeometry(pipe, nodes) {
+  if (pipe.length && pipe.length > 0) return pipe.length;
+  if (pipe.geometry && pipe.geometry.length >= 2) {
+    let total = 0;
+    for (let i = 1; i < pipe.geometry.length; i++) {
+      total += haversine(
+        pipe.geometry[i - 1][0],
+        pipe.geometry[i - 1][1],
+        pipe.geometry[i][0],
+        pipe.geometry[i][1]
+      );
+    }
+    return total;
+  }
+  const from = nodes.find((n) => n.id === pipe.fromNode);
+  const to = nodes.find((n) => n.id === pipe.toNode);
+  if (!from || !to) return 0;
+  return haversine(from.lng, from.lat, to.lng, to.lat);
+}
+function haversine(lng1, lat1, lng2, lat2) {
+  const R = 6371e3;
+  const toRad = (d) => d * Math.PI / 180;
+  const dLat = toRad(lat2 - lat1);
+  const dLng = toRad(lng2 - lng1);
+  const a = Math.sin(dLat / 2) ** 2 + Math.cos(toRad(lat1)) * Math.cos(toRad(lat2)) * Math.sin(dLng / 2) ** 2;
+  return 2 * R * Math.asin(Math.sqrt(a));
+}
+function neighborIds(adj, nodeId) {
+  const list = adj.get(nodeId) ?? [];
+  const seen = /* @__PURE__ */ new Set();
+  const out = [];
+  for (const e of list) {
+    if (!seen.has(e.to)) {
+      seen.add(e.to);
+      out.push(e.to);
+    }
+  }
+  return out;
+}
+function edgesOf(adj, nodeId) {
+  return adj.get(nodeId) ?? [];
+}
+
+// src/graph/bfs.ts
+function bfs(adj, start, opts = {}) {
+  const visited = [];
+  const parents = /* @__PURE__ */ new Map();
+  const visitedSet = /* @__PURE__ */ new Set();
+  if (!adj.has(start)) {
+    parents.set(start, null);
+    return { visited, parents, start };
+  }
+  if (opts.allowStart && !opts.allowStart(start)) {
+    return { visited: [], parents, start };
+  }
+  const queue = [{ id: start, depth: 0 }];
+  parents.set(start, null);
+  visitedSet.add(start);
+  visited.push(start);
+  let foundEnd;
+  while (queue.length > 0) {
+    const { id, depth } = queue.shift();
+    if (opts.until && opts.until(id)) {
+      foundEnd = id;
+      break;
+    }
+    if (opts.maxDepth !== void 0 && depth >= opts.maxDepth) continue;
+    const edges = adj.get(id) ?? [];
+    for (const e of edges) {
+      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;
+      if (visitedSet.has(e.to)) continue;
+      visitedSet.add(e.to);
+      parents.set(e.to, id);
+      visited.push(e.to);
+      queue.push({ id: e.to, depth: depth + 1 });
+    }
+  }
+  return { visited, parents, start, end: foundEnd };
+}
+function multiSourceBfs(adj, starts, opts = {}) {
+  const visited = [];
+  const parents = /* @__PURE__ */ new Map();
+  const sourceMap = /* @__PURE__ */ new Map();
+  const visitedSet = /* @__PURE__ */ new Set();
+  const queue = [];
+  for (const s of starts) {
+    if (!adj.has(s)) continue;
+    if (opts.allowStart && !opts.allowStart(s)) continue;
+    if (!visitedSet.has(s)) {
+      visitedSet.add(s);
+      parents.set(s, null);
+      sourceMap.set(s, s);
+      visited.push(s);
+      queue.push({ id: s, depth: 0 });
+    }
+  }
+  while (queue.length > 0) {
+    const { id, depth } = queue.shift();
+    if (opts.maxDepth !== void 0 && depth >= opts.maxDepth) continue;
+    const edges = adj.get(id) ?? [];
+    for (const e of edges) {
+      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;
+      if (visitedSet.has(e.to)) continue;
+      visitedSet.add(e.to);
+      parents.set(e.to, id);
+      sourceMap.set(e.to, sourceMap.get(id));
+      visited.push(e.to);
+      queue.push({ id: e.to, depth: depth + 1 });
+    }
+  }
+  return { visited, parents, start: starts[0] ?? "", sourceMap };
+}
+function reconstructPath(parents, end) {
+  const path = [];
+  let cur = end;
+  while (cur) {
+    path.unshift(cur);
+    const p = parents.get(cur);
+    cur = p ?? null;
+    if (cur === null && p === null) {
+      if (parents.get(end) === null && path.length === 1) break;
+      break;
+    }
+  }
+  if (path[0] !== end) ;
+  return path;
+}
+
+// src/graph/connectivity.ts
+function findConnectedComponents(adj, nodes) {
+  const visited = /* @__PURE__ */ new Set();
+  const components = [];
+  const kindById = /* @__PURE__ */ new Map();
+  for (const n of nodes) kindById.set(n.id, n.kind);
+  for (const nodeId of adj.keys()) {
+    if (visited.has(nodeId)) continue;
+    const r = bfs(adj, nodeId);
+    let hasSource = false;
+    for (const id of r.visited) {
+      visited.add(id);
+      if (kindById.get(id) === "source") hasSource = true;
+    }
+    components.push({
+      nodes: r.visited,
+      size: r.visited.length,
+      hasSource
+    });
+  }
+  return components;
+}
+function findPaths(adj, start, end, opts = {}) {
+  const maxPaths = opts.maxPaths ?? 3;
+  const maxDepth = opts.maxDepth ?? 20;
+  const all = [];
+  const path = [];
+  const onPath = /* @__PURE__ */ new Set();
+  const dfsLocal = (cur) => {
+    if (all.length >= maxPaths) return;
+    if (cur === end) {
+      all.push([...path]);
+      return;
+    }
+    if (path.length >= maxDepth) return;
+    onPath.add(cur);
+    path.push(cur);
+    const edges = adj.get(cur) ?? [];
+    for (const e of edges) {
+      if (onPath.has(e.to)) continue;
+      dfsLocal(e.to);
+      if (all.length >= maxPaths) return;
+    }
+    path.pop();
+    onPath.delete(cur);
+  };
+  dfsLocal(start);
+  return all;
+}
+function findUpstreamNode(adj, startPipeId, dataset, predicate) {
+  const pipe = dataset.pipes.find((p) => p.id === startPipeId);
+  if (!pipe) return null;
+  const nodeById = new Map(dataset.nodes.map((n) => [n.id, n]));
+  const startId = pipe.fromNode;
+  const startNode = nodeById.get(startId);
+  if (!startNode) return null;
+  const allowEdge = (e, _from, to) => {
+    const targetPipe = dataset.pipes.find((p) => p.id === e.pipeId);
+    if (!targetPipe) return false;
+    return true;
+  };
+  const r = bfs(adj, startId, {
+    allowEdge,
+    until: (n) => {
+      const node = nodeById.get(n);
+      return node ? predicate(node) : false;
+    },
+    maxDepth: 50
+  });
+  if (!r.end) return null;
+  return nodeById.get(r.end) ?? null;
+}
+function highlightConnectivity(adj, start) {
+  const r = bfs(adj, start, { maxDepth: 64 });
+  const nodeIds = new Set(r.visited);
+  const edgeIds = /* @__PURE__ */ new Set();
+  for (const n of r.visited) {
+    const edges = adj.get(n) ?? [];
+    for (const e of edges) {
+      if (nodeIds.has(e.to)) edgeIds.add(e.pipeId);
+    }
+  }
+  return { nodeIds, edgeIds };
+}
+
+// src/graph/shortestPath.ts
+function dijkstra(adj, start, end, opts = {}) {
+  if (!adj.has(start) || !adj.has(end)) {
+    return { distance: Infinity, path: [], found: false };
+  }
+  const weight = opts.weight ?? ((e) => e.length || 1);
+  const dist = /* @__PURE__ */ new Map();
+  const parents = /* @__PURE__ */ new Map();
+  const visited = /* @__PURE__ */ new Set();
+  const pq = [{ id: start, d: 0 }];
+  for (const n of adj.keys()) {
+    dist.set(n, Infinity);
+    parents.set(n, null);
+  }
+  dist.set(start, 0);
+  while (pq.length > 0) {
+    pq.sort((a, b) => a.d - b.d);
+    const cur2 = pq.shift();
+    if (visited.has(cur2.id)) continue;
+    visited.add(cur2.id);
+    if (cur2.id === end) break;
+    const edges = adj.get(cur2.id) ?? [];
+    for (const e of edges) {
+      if (visited.has(e.to)) continue;
+      const w = weight(e);
+      const alt = (dist.get(cur2.id) ?? Infinity) + w;
+      if (alt < (dist.get(e.to) ?? Infinity)) {
+        dist.set(e.to, alt);
+        parents.set(e.to, cur2.id);
+        pq.push({ id: e.to, d: alt });
+      }
+    }
+    if (opts.until && opts.until(cur2.id, cur2.d)) break;
+  }
+  if ((dist.get(end) ?? Infinity) === Infinity) {
+    return { distance: Infinity, path: [], found: false };
+  }
+  const path = [];
+  let cur = end;
+  while (cur) {
+    path.unshift(cur);
+    const p = parents.get(cur);
+    if (p === void 0) break;
+    cur = p;
+  }
+  return { distance: dist.get(end) ?? 0, path, found: true };
+}
+
+export { bfs, buildAdjacency, dijkstra, edgesOf, findConnectedComponents, findPaths, findUpstreamNode, haversine, highlightConnectivity, multiSourceBfs, neighborIds, pipeLengthFromGeometry, reconstructPath };
+//# sourceMappingURL=chunk-GCDA7KJM.js.map
+//# sourceMappingURL=chunk-GCDA7KJM.js.map

package/dist/chunk-GCDA7KJM.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/adjacency.ts","../src/graph/bfs.ts","../src/graph/connectivity.ts","../src/graph/shortestPath.ts"],"names":["cur"],"mappings":";AAoCO,SAAS,eAAe,OAAA,EAAiD;AAC9E,EAAA,MAAM,GAAA,uBAAyB,GAAA,EAAI;AAGnC,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAAA,EAC5C;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,QAAQ,KAAA,EAAO;AAChC,IAAA,MAAM,MAAM,IAAA,CAAK,MAAA,IAAU,uBAAuB,IAAA,EAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,CAAA;AAE1E,IAAA,MAAM,WAAW,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAQ,KAAK,EAAC;AAC5C,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,MAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,QAAA,EAAU,QAAQ,CAAA;AAE/B,IAAA,MAAM,SAAS,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,KAAK,EAAC;AACxC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,IAAI,IAAA,CAAK,QAAA;AAAA,MACT,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,MAAM,CAAA;AAAA,EAC7B;AAEA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,sBAAA,CACd,MACA,KAAA,EACQ;AACR,EAAA,IAAI,KAAK,MAAA,IAAU,IAAA,CAAK,MAAA,GAAS,CAAA,SAAU,IAAA,CAAK,MAAA;AAChD,EAAA,IAAI,IAAA,CAAK,QAAA,IAAY,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,EAAG;AAC9C,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,KAAA,IAAS,SAAA;AAAA,QACP,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA;AAAA,QACtB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC,CAAA;AAAA,QAClB,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,CAAC;AAAA,OACpB;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,QAAQ,CAAA;AACrD,EAAA,MAAM,EAAA,GAAK,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AACjD,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,EAAA,EAAI,OAAO,CAAA;AACzB,EAAA,OAAO,SAAA,CAAU,KAAK,GAAA,EAAK,IAAA,CAAK,KAAK,EAAA,CAAG,GAAA,EAAK,GAAG,GAAG,CAAA;AACrD;AAGO,SAAS,SAAA,CACd,IAAA,EACA,IAAA,EACA,IAAA,EACA,IAAA,EACQ;AACR,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,MAAM,KAAA,GAAQ,CAAC,CAAA,KAAe,CAAA,GAAI,KAAK,EAAA,GAAM,GAAA;AAC7C,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,GAAO,IAAI,CAAA;AAC9B,EAAA,MAAM,CAAA,GACJ,KAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA,GACtB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,GAClB,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,IACpB,IAAA,CAAK,GAAA,CAAI,IAAA,GAAO,CAAC,CAAA,IAAK,CAAA;AAC1B,EAAA,OAAO,IAAI,CAAA,GAAI,IAAA,CAAK,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AACvC;AAGO,SAAS,WAAA,CAAY,KAAoB,MAAA,EAA0B;AACxE,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,MAAM,KAAK,EAAC;AACjC,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACnB,MAAA,IAAA,CAAK,GAAA,CAAI,EAAE,EAAE,CAAA;AACb,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,EAAE,CAAA;AAAA,IACf;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,OAAA,CAAQ,KAAoB,MAAA,EAA2B;AACrE,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC;AAC7B;;;ACpFO,SAAS,GAAA,CACd,GAAA,EACA,KAAA,EACA,IAAA,GAAmB,EAAC,EACT;AACX,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,KAAK,CAAA,EAAG;AACnB,IAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAM;AAAA,EACnC;AAEA,EAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC9C,IAAA,OAAO,EAAE,OAAA,EAAS,EAAC,EAAG,SAAS,KAAA,EAAM;AAAA,EACvC;AAEA,EAAA,MAAM,QAA8C,CAAC,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AAC5E,EAAA,OAAA,CAAQ,GAAA,CAAI,OAAO,IAAI,CAAA;AACvB,EAAA,UAAA,CAAW,IAAI,KAAK,CAAA;AACpB,EAAA,OAAA,CAAQ,KAAK,KAAK,CAAA;AAElB,EAAA,IAAI,QAAA;AACJ,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,EAAG;AAChC,MAAA,QAAA,GAAW,EAAA;AACX,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,KAAA,EAAO,KAAK,QAAA,EAAS;AAClD;AAOO,SAAS,cAAA,CACd,GAAA,EACA,MAAA,EACA,IAAA,GAAmB,EAAC,EAC4B;AAChD,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAoB;AAC1C,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAY;AAEnC,EAAA,MAAM,QAA8C,EAAC;AAErD,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,IAAA,IAAI,KAAK,UAAA,IAAc,CAAC,IAAA,CAAK,UAAA,CAAW,CAAC,CAAA,EAAG;AAC5C,IAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACtB,MAAA,UAAA,CAAW,IAAI,CAAC,CAAA;AAChB,MAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AACnB,MAAA,SAAA,CAAU,GAAA,CAAI,GAAG,CAAC,CAAA;AAClB,MAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,MAAA,KAAA,CAAM,KAAK,EAAE,EAAA,EAAI,CAAA,EAAG,KAAA,EAAO,GAAG,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,EAAE,EAAA,EAAI,KAAA,EAAM,GAAI,MAAM,KAAA,EAAM;AAElC,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,MAAA,IAAa,KAAA,IAAS,KAAK,QAAA,EAAU;AAE3D,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,KAAK,EAAC;AAC9B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,IAAA,CAAK,aAAa,CAAC,IAAA,CAAK,UAAU,CAAA,EAAG,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACpD,MAAA,IAAI,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAC1B,MAAA,UAAA,CAAW,GAAA,CAAI,EAAE,EAAE,CAAA;AACnB,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,EAAE,CAAA;AACpB,MAAA,SAAA,CAAU,IAAI,CAAA,CAAE,EAAA,EAAI,SAAA,CAAU,GAAA,CAAI,EAAE,CAAE,CAAA;AACtC,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAE,CAAA;AACjB,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,KAAA,EAAO,KAAA,GAAQ,GAAG,CAAA;AAAA,IAC3C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAS,KAAA,EAAO,OAAO,CAAC,CAAA,IAAK,IAAI,SAAA,EAAU;AAC/D;AAOO,SAAS,eAAA,CACd,SACA,GAAA,EACU;AACV,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,GAAA,GAAM,CAAA,IAAK,IAAA;AACX,IAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,CAAA,KAAM,IAAA,EAAM;AAE9B,MAAA,IAAI,QAAQ,GAAA,CAAI,GAAG,MAAM,IAAA,IAAQ,IAAA,CAAK,WAAW,CAAA,EAAG;AACpD,MAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,GAAA,EAAK;AAGrB,EAAA,OAAO,IAAA;AACT;;;AC9IO,SAAS,uBAAA,CACd,KACA,KAAA,EACsB;AACtB,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,aAAmC,EAAC;AAE1C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO,QAAA,CAAS,IAAI,CAAA,CAAE,EAAA,EAAI,EAAE,IAAI,CAAA;AAEhD,EAAA,KAAA,MAAW,MAAA,IAAU,GAAA,CAAI,IAAA,EAAK,EAAG;AAC/B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,EAAG;AACzB,IAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,MAAM,CAAA;AACzB,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,EAAA,IAAM,EAAE,OAAA,EAAS;AAC1B,MAAA,OAAA,CAAQ,IAAI,EAAE,CAAA;AACd,MAAA,IAAI,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,KAAM,UAAU,SAAA,GAAY,IAAA;AAAA,IACjD;AACA,IAAA,UAAA,CAAW,IAAA,CAAK;AAAA,MACd,OAAO,CAAA,CAAE,OAAA;AAAA,MACT,IAAA,EAAM,EAAE,OAAA,CAAQ,MAAA;AAAA,MAChB;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,UAAA;AACT;AAQO,SAAS,UACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAAiD,EAAC,EACtC;AACZ,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,CAAA;AAClC,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,EAAA;AAElC,EAAA,MAAM,MAAkB,EAAC;AACzB,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAE/B,EAAA,MAAM,QAAA,GAAW,CAAC,GAAA,KAAgB;AAChC,IAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAC5B,IAAA,IAAI,QAAQ,GAAA,EAAK;AACf,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAG,IAAI,CAAC,CAAA;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAA,CAAO,IAAI,GAAG,CAAA;AACd,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AACb,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,GAAG,KAAK,EAAC;AAC/B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,MAAA,CAAO,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACtB,MAAA,QAAA,CAAS,EAAE,EAAE,CAAA;AACb,MAAA,IAAI,GAAA,CAAI,UAAU,QAAA,EAAU;AAAA,IAC9B;AACA,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,EACnB,CAAA;AAEA,EAAA,QAAA,CAAS,KAAK,CAAA;AACd,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,gBAAA,CACd,GAAA,EACA,WAAA,EACA,OAAA,EACA,SAAA,EACqB;AACrB,EAAA,MAAM,IAAA,GAAO,QAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,OAAO,WAAW,CAAA;AAC3D,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAG5D,EAAA,MAAM,UAAU,IAAA,CAAK,QAAA;AACrB,EAAA,MAAM,SAAA,GAAY,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AACtC,EAAA,IAAI,CAAC,WAAW,OAAO,IAAA;AAGvB,EAAA,MAAM,SAAA,GAAY,CAAC,CAAA,EAAY,KAAA,EAAe,EAAA,KAAe;AAE3D,IAAA,MAAM,UAAA,GAAa,QAAQ,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,CAAA,CAAE,MAAM,CAAA;AAC9D,IAAA,IAAI,CAAC,YAAY,OAAO,KAAA;AAExB,IAAA,OAAO,IAAA;AAAA,EACT,CAAA;AAGA,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,EAAK,OAAA,EAAS;AAAA,IAC1B,SAAA;AAAA,IACA,KAAA,EAAO,CAAC,CAAA,KAAM;AACZ,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AAC3B,MAAA,OAAO,IAAA,GAAO,SAAA,CAAU,IAAI,CAAA,GAAI,KAAA;AAAA,IAClC,CAAA;AAAA,IACA,QAAA,EAAU;AAAA,GACX,CAAA;AAED,EAAA,IAAI,CAAC,CAAA,CAAE,GAAA,EAAK,OAAO,IAAA;AACnB,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,GAAG,CAAA,IAAK,IAAA;AAChC;AAOO,SAAS,qBAAA,CACd,KACA,KAAA,EACgD;AAChD,EAAA,MAAM,IAAI,GAAA,CAAI,GAAA,EAAK,OAAO,EAAE,QAAA,EAAU,IAAI,CAAA;AAC1C,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,CAAA,CAAE,OAAO,CAAA;AACjC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,KAAA,MAAW,CAAA,IAAK,EAAE,OAAA,EAAS;AACzB,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,CAAC,KAAK,EAAC;AAC7B,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AAErB,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAE,GAAG,OAAA,CAAQ,GAAA,CAAI,EAAE,MAAM,CAAA;AAAA,IAC7C;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,SAAS,OAAA,EAAQ;AAC5B;;;ACxIO,SAAS,SACd,GAAA,EACA,KAAA,EACA,GAAA,EACA,IAAA,GAA4B,EAAC,EACT;AACpB,EAAA,IAAI,CAAC,IAAI,GAAA,CAAI,KAAK,KAAK,CAAC,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA,EAAG;AACpC,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAEA,EAAA,MAAM,SAAS,IAAA,CAAK,MAAA,KAAW,CAAC,CAAA,KAAe,EAAE,MAAA,IAAU,CAAA,CAAA;AAE3D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA2B;AAC/C,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAuC,CAAC,EAAE,IAAI,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA;AAEjE,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,IAAA,EAAK,EAAG;AAC1B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAG,QAAQ,CAAA;AACpB,IAAA,OAAA,CAAQ,GAAA,CAAI,GAAG,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,OAAO,CAAC,CAAA;AAEjB,EAAA,OAAO,EAAA,CAAG,SAAS,CAAA,EAAG;AAEpB,IAAA,EAAA,CAAG,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,CAAA,GAAI,EAAE,CAAC,CAAA;AAC3B,IAAA,MAAMA,IAAAA,GAAM,GAAG,KAAA,EAAM;AACrB,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAIA,IAAAA,CAAI,EAAE,CAAA,EAAG;AACzB,IAAA,OAAA,CAAQ,GAAA,CAAIA,KAAI,EAAE,CAAA;AAClB,IAAA,IAAIA,IAAAA,CAAI,OAAO,GAAA,EAAK;AAEpB,IAAA,MAAM,QAAQ,GAAA,CAAI,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,EAAC;AAClC,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AACvB,MAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,MAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAIA,IAAAA,CAAI,EAAE,KAAK,QAAA,IAAY,CAAA;AAC7C,MAAA,IAAI,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAE,KAAK,QAAA,CAAA,EAAW;AACtC,QAAA,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,GAAG,CAAA;AAClB,QAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,CAAE,EAAA,EAAIA,IAAAA,CAAI,EAAE,CAAA;AACxB,QAAA,EAAA,CAAG,KAAK,EAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAA,EAAG,KAAK,CAAA;AAAA,MAC9B;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,IAAA,CAAK,KAAA,CAAMA,KAAI,EAAA,EAAIA,IAAAA,CAAI,CAAC,CAAA,EAAG;AAAA,EAC/C;AAEA,EAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,cAAc,QAAA,EAAU;AAC5C,IAAA,OAAO,EAAE,QAAA,EAAU,QAAA,EAAU,MAAM,EAAC,EAAG,OAAO,KAAA,EAAM;AAAA,EACtD;AAGA,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,IAAI,GAAA,GAAqB,GAAA;AACzB,EAAA,OAAO,GAAA,EAAK;AACV,IAAA,IAAA,CAAK,QAAQ,GAAG,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AACzB,IAAA,IAAI,MAAM,MAAA,EAAW;AACrB,IAAA,GAAA,GAAM,CAAA;AAAA,EACR;AAEA,EAAA,OAAO,EAAE,UAAU,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,IAAK,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,IAAA,EAAK;AAC3D","file":"chunk-GCDA7KJM.js","sourcesContent":["/**\n * 图邻接表构建（管线拓扑 → 双向邻接表）\n *\n * 输入：管网拓扑数据集（节点 + 管段）\n * 输出：邻接表 Map<nodeId, Edge[]>\n *\n * Phase 1 图遍历的入口：把物理拓扑转换为图论可用的数据结构。\n */\n\nimport type {\n  PipelineNode,\n  PipelinePipe,\n  PipelineTopologyDataset,\n} from '../types';\n\n/**\n * 邻接表中的\"边\"\n *  - 物理上一条 pipe 是两个 node 之间的连接\n *  - 邻接表中记录：pipeId、邻居节点 id、长度等\n */\nexport interface AdjEdge {\n  pipeId: string;\n  /** 邻居节点 id（沿此边走一步到达） */\n  to: string;\n  /** 长度（m），无则 0 */\n  length: number;\n  /** 阻力/权重（用于复杂路径优选，可选） */\n  weight?: number;\n}\n\n/** 邻接表：Map<nodeId, AdjEdge[]> */\nexport type AdjacencyList = Map<string, AdjEdge[]>;\n\n/**\n * 从 PipelineTopologyDataset 构建邻接表\n */\nexport function buildAdjacency(dataset: PipelineTopologyDataset): AdjacencyList {\n  const adj: AdjacencyList = new Map();\n\n  // 初始化所有节点（防止孤立点不出现）\n  for (const node of dataset.nodes) {\n    if (!adj.has(node.id)) adj.set(node.id, []);\n  }\n\n  for (const pipe of dataset.pipes) {\n    const len = pipe.length ?? pipeLengthFromGeometry(pipe, dataset.nodes) ?? 0;\n\n    const fromList = adj.get(pipe.fromNode) ?? [];\n    fromList.push({\n      pipeId: pipe.id,\n      to: pipe.toNode,\n      length: len,\n    });\n    adj.set(pipe.fromNode, fromList);\n\n    const toList = adj.get(pipe.toNode) ?? [];\n    toList.push({\n      pipeId: pipe.id,\n      to: pipe.fromNode,\n      length: len,\n    });\n    adj.set(pipe.toNode, toList);\n  }\n\n  return adj;\n}\n\n/**\n * 计算单条 pipe 长度（haversine）\n * 若 pipe 提供 geometry 则累计几何点距离，否则按 from-to 直线长度。\n */\nexport function pipeLengthFromGeometry(\n  pipe: PipelinePipe,\n  nodes: PipelineNode[]\n): number {\n  if (pipe.length && pipe.length > 0) return pipe.length;\n  if (pipe.geometry && pipe.geometry.length >= 2) {\n    let total = 0;\n    for (let i = 1; i < pipe.geometry.length; i++) {\n      total += haversine(\n        pipe.geometry[i - 1][0],\n        pipe.geometry[i - 1][1],\n        pipe.geometry[i][0],\n        pipe.geometry[i][1]\n      );\n    }\n    return total;\n  }\n  const from = nodes.find((n) => n.id === pipe.fromNode);\n  const to = nodes.find((n) => n.id === pipe.toNode);\n  if (!from || !to) return 0;\n  return haversine(from.lng, from.lat, to.lng, to.lat);\n}\n\n/** Haversine 距离（m） */\nexport function haversine(\n  lng1: number,\n  lat1: number,\n  lng2: number,\n  lat2: number\n): number {\n  const R = 6_371_000;\n  const toRad = (d: number) => (d * Math.PI) / 180;\n  const dLat = toRad(lat2 - lat1);\n  const dLng = toRad(lng2 - lng1);\n  const a =\n    Math.sin(dLat / 2) ** 2 +\n    Math.cos(toRad(lat1)) *\n      Math.cos(toRad(lat2)) *\n      Math.sin(dLng / 2) ** 2;\n  return 2 * R * Math.asin(Math.sqrt(a));\n}\n\n/** 从邻接表拿指定节点的邻居 id 列表（去重） */\nexport function neighborIds(adj: AdjacencyList, nodeId: string): string[] {\n  const list = adj.get(nodeId) ?? [];\n  const seen = new Set<string>();\n  const out: string[] = [];\n  for (const e of list) {\n    if (!seen.has(e.to)) {\n      seen.add(e.to);\n      out.push(e.to);\n    }\n  }\n  return out;\n}\n\n/** 取出指定节点的所有边 */\nexport function edgesOf(adj: AdjacencyList, nodeId: string): AdjEdge[] {\n  return adj.get(nodeId) ?? [];\n}\n","/**\n * BFS（广度优先遍历）\n *\n * 用途：\n * - 爆管推演：下游影响范围（沿拓扑扩散）\n * - 连通性查询：在指定层级内查找可达节点\n *\n * 实现要点：\n * - 支持 visited / parents 记录\n * - 支持 maxDepth 限制（避免极大连通分量过长）\n * - 支持 predicate 过滤可继续遍历的邻居\n * - 可返回\"沿途经过的管段\"列表（用于前端高亮）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface BfsResult {\n  /** 访问过的节点（不重复） */\n  visited: string[];\n  /** 父节点表：node -> 上一步到达的 node（首节点为自身） */\n  parents: Map<string, string | null>;\n  /** 起点 节点 */\n  start: string;\n  /** 终点节点（搜到即停，返回时 visited 是到终点为止的节点） */\n  end?: string;\n}\n\nexport interface BfsOptions {\n  /** 最大深度（边数），默认无限制 */\n  maxDepth?: number;\n  /** 是否指定终点（BFS 找到则停止） */\n  until?: (node: string) => boolean;\n  /** 在扩展邻居前过滤：false 则该方向不继续遍历 */\n  allowEdge?: (edge: AdjEdge, from: string, to: string) => boolean;\n  /** 起点本身的过滤器（如只走下游/上游） */\n  allowStart?: (node: string) => boolean;\n}\n\n/**\n * 标准 BFS，可指定\"任意邻居是否可达\"\n *\n * 用法：\n *   const r = bfs(adj, 'node-A');\n *   bfs(adj, 'start', { until: (n) => n === 'target' }); // 找终点\n *   bfs(adj, 'start', { allowEdge: (_, __, to) => to !== 'forbidden' });\n */\nexport function bfs(\n  adj: AdjacencyList,\n  start: string,\n  opts: BfsOptions = {}\n): BfsResult {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const visitedSet = new Set<string>();\n\n  if (!adj.has(start)) {\n    parents.set(start, null);\n    return { visited, parents, start };\n  }\n\n  if (opts.allowStart && !opts.allowStart(start)) {\n    return { visited: [], parents, start };\n  }\n\n  const queue: Array<{ id: string; depth: number }> = [{ id: start, depth: 0 }];\n  parents.set(start, null);\n  visitedSet.add(start);\n  visited.push(start);\n\n  let foundEnd: string | undefined;\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n\n    if (opts.until && opts.until(id)) {\n      foundEnd = id;\n      break;\n    }\n\n    // maxDepth 语义：最多走 N 条边，到达节点的最短路径长度为 N\n    // 当前节点 depth=d = 经过 d 条边到达，扩展邻居须 depth+1 <= maxDepth\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start, end: foundEnd };\n}\n\n/**\n * 多源 BFS（同时从多个起点扩散）\n *\n * 用法：爆管分析的下游影响可从多点同时推演（如多个隔离阀门的下游剩余服务区）\n */\nexport function multiSourceBfs(\n  adj: AdjacencyList,\n  starts: string[],\n  opts: BfsOptions = {}\n): BfsResult & { sourceMap: Map<string, string> } {\n  const visited: string[] = [];\n  const parents = new Map<string, string | null>();\n  const sourceMap = new Map<string, string>();\n  const visitedSet = new Set<string>();\n\n  const queue: Array<{ id: string; depth: number }> = [];\n\n  for (const s of starts) {\n    if (!adj.has(s)) continue;\n    if (opts.allowStart && !opts.allowStart(s)) continue;\n    if (!visitedSet.has(s)) {\n      visitedSet.add(s);\n      parents.set(s, null);\n      sourceMap.set(s, s);\n      visited.push(s);\n      queue.push({ id: s, depth: 0 });\n    }\n  }\n\n  while (queue.length > 0) {\n    const { id, depth } = queue.shift()!;\n    // 同单源 BFS：depth=d 时扩展邻居；maxDepth=N 表示最多 N 条边\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth) continue;\n\n    const edges = adj.get(id) ?? [];\n    for (const e of edges) {\n      if (opts.allowEdge && !opts.allowEdge(e, id, e.to)) continue;\n      if (visitedSet.has(e.to)) continue;\n      visitedSet.add(e.to);\n      parents.set(e.to, id);\n      sourceMap.set(e.to, sourceMap.get(id)!);\n      visited.push(e.to);\n      queue.push({ id: e.to, depth: depth + 1 });\n    }\n  }\n\n  return { visited, parents, start: starts[0] ?? '', sourceMap };\n}\n\n/**\n * 反向 BFS（沿父指针回溯）\n *\n * 给定终点 + parents Map，可还原 BFS 路径（用于\"找到的最短路径\"）。\n */\nexport function reconstructPath(\n  parents: Map<string, string | null>,\n  end: string\n): string[] {\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    cur = p ?? null;\n    if (cur === null && p === null) {\n      // 起点到达\n      if (parents.get(end) === null && path.length === 1) break;\n      break;\n    }\n  }\n  if (path[0] !== end) {\n    // already include end correctly\n  }\n  return path;\n}\n","/**\n * 连通性分析\n *\n * 用途：\n * - P-4 连通性高亮：选中管线后高亮上下游连通路径\n * - 健康评估的影响范围计算\n * - 用户问\"阀门X关闭后影响哪些小区？\"\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\nimport { bfs } from './bfs';\nimport type { PipelineNode, PipelineTopologyDataset, NodeKind } from '../types';\n\n/**\n * 连通分量（连通子图）\n */\nexport interface ConnectedComponent {\n  /** 节点集合 */\n  nodes: string[];\n  /** 节点数 */\n  size: number;\n  /** 是否包含 source 类型节点（影响气源/水源判定） */\n  hasSource: boolean;\n}\n\n/**\n * 求所有连通分量\n */\nexport function findConnectedComponents(\n  adj: AdjacencyList,\n  nodes: PipelineNode[]\n): ConnectedComponent[] {\n  const visited = new Set<string>();\n  const components: ConnectedComponent[] = [];\n\n  const kindById = new Map<string, NodeKind>();\n  for (const n of nodes) kindById.set(n.id, n.kind);\n\n  for (const nodeId of adj.keys()) {\n    if (visited.has(nodeId)) continue;\n    const r = bfs(adj, nodeId);\n    let hasSource = false;\n    for (const id of r.visited) {\n      visited.add(id);\n      if (kindById.get(id) === 'source') hasSource = true;\n    }\n    components.push({\n      nodes: r.visited,\n      size: r.visited.length,\n      hasSource,\n    });\n  }\n\n  return components;\n}\n\n/**\n * 找到两个节点之间的所有路径（k 短路）\n *\n * 用途：阀门隔离方案中\"备选路径\"分析\n * NOTE：DFS+Yen's 算法简化版，路径数 < 10 适用。\n */\nexport function findPaths(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: { maxPaths?: number; maxDepth?: number } = {}\n): string[][] {\n  const maxPaths = opts.maxPaths ?? 3;\n  const maxDepth = opts.maxDepth ?? 20;\n\n  const all: string[][] = [];\n  const path: string[] = [];\n  const onPath = new Set<string>();\n\n  const dfsLocal = (cur: string) => {\n    if (all.length >= maxPaths) return;\n    if (cur === end) {\n      all.push([...path]);\n      return;\n    }\n    if (path.length >= maxDepth) return;\n    onPath.add(cur);\n    path.push(cur);\n    const edges = adj.get(cur) ?? [];\n    for (const e of edges) {\n      if (onPath.has(e.to)) continue;\n      dfsLocal(e.to);\n      if (all.length >= maxPaths) return;\n    }\n    path.pop();\n    onPath.delete(cur);\n  };\n\n  dfsLocal(start);\n  return all;\n}\n\n/**\n * 沿拓扑向上游找到最近的指定类型节点（默认阀门）\n *\n * 用途：爆管推演自动定位隔离点（PRD §4.2.4 step 1）\n */\nexport function findUpstreamNode(\n  adj: AdjacencyList,\n  startPipeId: string,\n  dataset: PipelineTopologyDataset,\n  predicate: (n: PipelineNode) => boolean\n): PipelineNode | null {\n  const pipe = dataset.pipes.find((p) => p.id === startPipeId);\n  if (!pipe) return null;\n\n  const nodeById = new Map(dataset.nodes.map((n) => [n.id, n]));\n\n  // 起始：pipe 任意一端的\"非故障方向\" → 选择 fromNode 作为查找起点\n  const startId = pipe.fromNode;\n  const startNode = nodeById.get(startId);\n  if (!startNode) return null;\n\n  // 反向游走：只允许沿\"反向\"（即 from 是 to，to 是 from）前进\n  const allowEdge = (e: AdjEdge, _from: string, to: string) => {\n    // 边界：pipe 同时含 startId 端则允许从 startId 反向走\n    const targetPipe = dataset.pipes.find((p) => p.id === e.pipeId);\n    if (!targetPipe) return false;\n    // 始终允许走（无向图）\n    return true;\n  };\n\n  // BFS 到上层直到命中 predicate\n  const r = bfs(adj, startId, {\n    allowEdge,\n    until: (n) => {\n      const node = nodeById.get(n);\n      return node ? predicate(node) : false;\n    },\n    maxDepth: 50,\n  });\n\n  if (!r.end) return null;\n  return nodeById.get(r.end) ?? null;\n}\n\n/**\n * 高亮连通路径（从起点 BFS，把沿途所有 pipe 收集起来）\n *\n * 用途：选中管段/节点 → 高亮上下游\n */\nexport function highlightConnectivity(\n  adj: AdjacencyList,\n  start: string\n): { nodeIds: Set<string>; edgeIds: Set<string> } {\n  const r = bfs(adj, start, { maxDepth: 64 });\n  const nodeIds = new Set(r.visited);\n  const edgeIds = new Set<string>();\n\n  for (const n of r.visited) {\n    const edges = adj.get(n) ?? [];\n    for (const e of edges) {\n      // 只高亮两端都已访问的边\n      if (nodeIds.has(e.to)) edgeIds.add(e.pipeId);\n    }\n  }\n\n  return { nodeIds, edgeIds };\n}\n","/**\n * 最短路径（Dijkstra）\n *\n * 用途：\n * - 上游距离最近的阀门定位\n * - 备选供气/供水路径（按管径/压力选优）\n */\n\nimport type { AdjacencyList, AdjEdge } from './adjacency';\n\nexport interface ShortestPathResult {\n  distance: number;\n  path: string[];\n  found: boolean;\n}\n\nexport interface ShortestPathOptions {\n  /** 边权重函数：默认 1 */\n  weight?: (edge: AdjEdge) => number;\n  /** 提前终止：找到满足条件的节点立即返回 */\n  until?: (node: string, dist: number) => boolean;\n}\n\n/**\n * Dijkstra 最短路径\n *\n * 注意：当存在负权边时不可用；管网场景边权重非负，管长/管径均适用。\n */\nexport function dijkstra(\n  adj: AdjacencyList,\n  start: string,\n  end: string,\n  opts: ShortestPathOptions = {}\n): ShortestPathResult {\n  if (!adj.has(start) || !adj.has(end)) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  const weight = opts.weight ?? ((e: AdjEdge) => e.length || 1);\n\n  const dist = new Map<string, number>();\n  const parents = new Map<string, string | null>();\n  const visited = new Set<string>();\n  const pq: Array<{ id: string; d: number }> = [{ id: start, d: 0 }];\n\n  for (const n of adj.keys()) {\n    dist.set(n, Infinity);\n    parents.set(n, null);\n  }\n  dist.set(start, 0);\n\n  while (pq.length > 0) {\n    // 简化：线性查找最小值（小图足够；大规模可换二叉堆）\n    pq.sort((a, b) => a.d - b.d);\n    const cur = pq.shift()!;\n    if (visited.has(cur.id)) continue;\n    visited.add(cur.id);\n    if (cur.id === end) break;\n\n    const edges = adj.get(cur.id) ?? [];\n    for (const e of edges) {\n      if (visited.has(e.to)) continue;\n      const w = weight(e);\n      const alt = (dist.get(cur.id) ?? Infinity) + w;\n      if (alt < (dist.get(e.to) ?? Infinity)) {\n        dist.set(e.to, alt);\n        parents.set(e.to, cur.id);\n        pq.push({ id: e.to, d: alt });\n      }\n    }\n\n    if (opts.until && opts.until(cur.id, cur.d)) break;\n  }\n\n  if ((dist.get(end) ?? Infinity) === Infinity) {\n    return { distance: Infinity, path: [], found: false };\n  }\n\n  // 回溯路径\n  const path: string[] = [];\n  let cur: string | null = end;\n  while (cur) {\n    path.unshift(cur);\n    const p = parents.get(cur);\n    if (p === undefined) break;\n    cur = p;\n  }\n\n  return { distance: dist.get(end) ?? 0, path, found: true };\n}\n"]}