@floegence/floe-webapp-core 0.86.12 → 0.86.13

package/dist/components/graph/routing.js

@@ -1,277 +1,276 @@
-import { AvoidLib as J } from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/index.js";
-import Y from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/libavoid.wasm.js";
-let j;
-const V = { NORTH: 1, SOUTH: 2, WEST: 4, EAST: 8 }, b = ["NORTH", "EAST", "SOUTH", "WEST"], E = (t) => t.delete();
-async function I(t, c = {}) {
-  const p = c.edgeClearance ?? 4;
-  if (!Number.isFinite(p) || p < 0)
+import { AvoidLib as Y } from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/index.js";
+import tt from "../../node_modules/.pnpm/libavoid-js@0.5.0-beta.5/node_modules/libavoid-js/dist/libavoid.wasm.js";
+let _;
+const L = { NORTH: 1, SOUTH: 2, WEST: 4, EAST: 8 }, A = ["NORTH", "EAST", "SOUTH", "WEST"], S = (n) => n.delete();
+async function et(n, o = {}) {
+  const a = o.edgeClearance ?? 4;
+  if (!Number.isFinite(a) || a < 0)
     throw new Error("Graph edge clearance must be finite and nonnegative");
-  if (!t.nodes.length) return t;
-  if (!t.edges.length) return X(t);
-  await (j ??= J.load(Y).catch((o) => {
-    throw j = void 0, o;
+  if (!n.nodes.length) return n;
+  if (!n.edges.length) return $(n);
+  await (_ ??= Y.load(tt).catch((r) => {
+    throw _ = void 0, r;
   }));
-  const s = J.getInstance(), r = new Map(t.nodes.map((o) => [o.id, o])), m = (o) => {
-    const e = [];
-    for (let i = r.get(o).parentId; i; i = r.get(i).parentId)
-      e.push(i);
-    return e;
-  }, d = /* @__PURE__ */ new Map();
-  for (const o of t.edges) {
-    const e = /* @__PURE__ */ new Set([...m(o.source), ...m(o.target)]), i = JSON.stringify([...e].sort()), u = d.get(i) ?? { open: e, edges: [] };
-    u.edges.push(o), d.set(i, u);
+  const i = Y.getInstance(), h = new Map(n.nodes.map((r) => [r.id, r])), l = (r) => {
+    const c = [];
+    for (let s = h.get(r).parentId; s; s = h.get(s).parentId)
+      c.push(s);
+    return c;
+  }, f = /* @__PURE__ */ new Map();
+  for (const r of n.edges) {
+    const c = /* @__PURE__ */ new Set([...l(r.source), ...l(r.target)]), s = JSON.stringify([...c].sort()), M = f.get(s) ?? { open: c, edges: [] };
+    M.edges.push(r), f.set(s, M);
   }
-  const S = /* @__PURE__ */ new Map();
-  for (const { open: o, edges: e } of d.values()) {
-    const i = new s.Router(2);
+  const T = /* @__PURE__ */ new Map();
+  for (const { open: r, edges: c } of f.values()) {
+    const s = new i.Router(2);
     try {
-      i.setRoutingParameter(s.RoutingParameter.shapeBufferDistance, p), i.setRoutingParameter(s.RoutingParameter.idealNudgingDistance, 8), i.setRoutingParameter(s.RoutingParameter.crossingPenalty, 80), i.setRoutingParameter(s.RoutingParameter.fixedSharedPathPenalty, 120), i.setRoutingParameter(s.RoutingParameter.portDirectionPenalty, 0), i.setRoutingOption(s.RoutingOption.nudgeOrthogonalSegmentsConnectedToShapes, !1), i.setRoutingOption(s.RoutingOption.nudgeSharedPathsWithCommonEndPoint, !0);
-      const u = new Map(
-        t.nodes.filter((n) => !o.has(n.id) && m(n.id).every((x) => o.has(x))).map((n) => {
-          const x = new s.Point(n.x, n.y), y = new s.Point(n.x + n.width, n.y + n.height), a = new s.Rectangle(x, y), h = new s.ShapeRef(i, a);
-          return E(x), E(y), E(a), [n.id, h];
+      s.setRoutingParameter(i.RoutingParameter.shapeBufferDistance, a), s.setRoutingParameter(i.RoutingParameter.idealNudgingDistance, 8), s.setRoutingParameter(i.RoutingParameter.crossingPenalty, 80), s.setRoutingParameter(i.RoutingParameter.fixedSharedPathPenalty, 120), s.setRoutingParameter(i.RoutingParameter.portDirectionPenalty, 0), s.setRoutingOption(i.RoutingOption.nudgeOrthogonalSegmentsConnectedToShapes, !1), s.setRoutingOption(i.RoutingOption.nudgeSharedPathsWithCommonEndPoint, !0);
+      const M = new Map(
+        n.nodes.filter((t) => !r.has(t.id) && l(t.id).every((e) => r.has(e))).map((t) => {
+          const e = new i.Point(t.x, t.y), g = new i.Point(t.x + t.width, t.y + t.height), p = new i.Rectangle(e, g), x = new i.ShapeRef(s, p);
+          return S(e), S(g), S(p), [t.id, x];
         })
-      ), v = /* @__PURE__ */ new Map(), l = t.nodes.filter((n) => u.has(n.id)), G = /* @__PURE__ */ new Map();
-      e.forEach((n) => {
-        const x = r.get(n.source), y = r.get(n.target), a = z(x, y), h = n.sourcePort ? x.ports.find((T) => T.id === n.sourcePort).side : n.targetPort ? D(y.ports.find((T) => T.id === n.targetPort).side) : a.source, g = n.targetPort ? y.ports.find((T) => T.id === n.targetPort).side : n.sourcePort ? D(x.ports.find((T) => T.id === n.sourcePort).side) : a.target, f = [n.source, n.target].sort().join("\0"), w = G.get(f) ?? 0;
-        G.set(f, w + 1);
-        const M = w % 2 === 0 ? -6 : 6, R = n.source === n.target ? void 0 : _(
-          x,
-          y,
-          l,
-          a,
-          M,
-          n.sourcePort ? h : void 0,
-          n.targetPort ? g : void 0
-        );
-        v.set(n.id, {
-          sourceSide: R?.source ?? h,
-          targetSide: R?.target ?? g,
-          offset: M
-        });
-      });
-      let U = b.length + 2;
-      const O = /* @__PURE__ */ new Map(), P = (n, x) => Math.max(0, Math.min(1, n / x));
-      for (const n of t.nodes) {
-        const x = u.get(n.id);
-        if (!x) continue;
-        const y = (a, h, g, f, w) => {
-          const M = new s.ShapeConnectionPin(
-            x,
-            a,
-            P(h, n.width),
-            P(g, n.height),
+      ), O = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map();
+      for (const t of c) {
+        const e = [t.source, t.target].sort().join("\0"), g = O.get(e) ?? 0;
+        O.set(e, g + 1), E.set(t.id, g % 2 === 0 ? -6 : 6);
+      }
+      let Q = A.length + 2;
+      const B = /* @__PURE__ */ new Map(), b = (t, e) => Math.max(0, Math.min(1, t / e));
+      for (const t of n.nodes) {
+        const e = M.get(t.id);
+        if (!e) continue;
+        const g = (p, x, w, y, m) => {
+          const N = new i.ShapeConnectionPin(
+            e,
+            p,
+            b(x, t.width),
+            b(w, t.height),
             !0,
             0,
-            f
+            y
           );
-          M.setExclusive(w), M.setConnectionCost(
-            n.width / 2 + n.height / 2 - Math.abs(h - n.width / 2) - Math.abs(g - n.height / 2)
+          N.setExclusive(m), N.setConnectionCost(
+            t.width / 2 + t.height / 2 - Math.abs(x - t.width / 2) - Math.abs(w - t.height / 2)
           );
         };
-        for (const a of new Set(n.ports?.map((h) => h.side))) {
-          const { x: h, y: g } = W(n, a), f = b.indexOf(a) + 2;
-          y(f, h - n.x, g - n.y, V[a], !1), O.set(
+        for (const p of new Set(t.ports?.map((x) => x.side))) {
+          const { x, y: w } = q(t, p), y = A.indexOf(p) + 2;
+          g(y, x - t.x, w - t.y, L[p], !1), B.set(
             JSON.stringify([
-              n.id,
-              P(h - n.x, n.width),
-              P(g - n.y, n.height),
-              a
+              t.id,
+              b(x - t.x, t.width),
+              b(w - t.y, t.height),
+              p
             ]),
-            f
+            y
           );
         }
       }
-      const C = (n, x, y, a) => {
-        const h = r.get(n), g = u.get(n);
-        if (g && x)
-          return new s.ConnEnd(
-            g,
-            b.indexOf(h.ports.find((R) => R.id === x).side) + 2
+      const F = /* @__PURE__ */ new Map(), Z = n.nodes.filter((t) => M.has(t.id)), J = (t, e, g, p, x, w = !1) => {
+        const y = M.get(t.id);
+        if (y && g)
+          return new i.ConnEnd(
+            y,
+            A.indexOf(t.ports.find((d) => d.id === g).side) + 2
           );
-        if (g) {
-          const R = P(y.x - h.x, h.width), T = P(y.y - h.y, h.height), A = JSON.stringify([n, R, T, a]), F = O.get(A);
-          if (F !== void 0) return new s.ConnEnd(g, F);
-          const B = U++;
-          return O.set(A, B), new s.ShapeConnectionPin(
-            g,
-            B,
-            R,
-            T,
-            !0,
-            0,
-            V[a]
-          ).setExclusive(!1), new s.ConnEnd(g, B);
+        const m = g ? [
+          {
+            side: t.ports.find((d) => d.id === g).side,
+            position: q(t, t.ports.find((d) => d.id === g).side)
+          }
+        ] : x ? [{ side: "EAST", position: x }] : (w ? [K(t, e).source] : A).flatMap((d) => {
+          const P = nt(t, d, e, p);
+          if (w) return [{ side: d, position: P }];
+          const R = d === "NORTH" || d === "SOUTH", H = R ? t.x : t.y, v = R ? t.width : t.height, C = H + Math.min(8, v / 4), j = H + v - Math.min(8, v / 4);
+          return [
+            R ? P.x : P.y,
+            C,
+            j,
+            ...Z.flatMap((u) => {
+              const k = R ? u.x : u.y, X = k + (R ? u.width : u.height);
+              return [k - a, X + a, k - a - 8, X + a + 8];
+            }).filter((u) => u >= C && u <= j)
+          ].map((u) => ({
+            side: d,
+            position: R ? { x: u, y: P.y } : { x: P.x, y: u }
+          }));
+        });
+        if (y) {
+          const d = (v, C) => JSON.stringify([
+            t.id,
+            b(C.x - t.x, t.width),
+            b(C.y - t.y, t.height),
+            v
+          ]), P = !!(g || x || w), R = P ? B.get(d(m[0].side, m[0].position)) : F.get(t.id);
+          if (P && R !== void 0) return new i.ConnEnd(y, R);
+          const H = R ?? Q++;
+          P || F.set(t.id, H);
+          for (const { side: v, position: C } of m) {
+            const j = d(v, C);
+            if (B.has(j)) continue;
+            B.set(j, H);
+            const D = C.x - t.x, u = C.y - t.y, k = new i.ShapeConnectionPin(
+              y,
+              H,
+              b(D, t.width),
+              b(u, t.height),
+              !0,
+              0,
+              L[v]
+            );
+            k.setExclusive(!1), k.setConnectionCost(
+              t.width / 2 + t.height / 2 - Math.abs(D - t.width / 2) - Math.abs(u - t.height / 2)
+            );
+          }
+          return new i.ConnEnd(y, H);
         }
-        const f = x ? W(h, h.ports.find((R) => R.id === x).side) : y, w = new s.Point(f.x, f.y), M = new s.ConnEnd(w);
-        return E(w), M;
-      }, N = e.map((n) => {
-        const x = r.get(n.source), y = r.get(n.target), a = v.get(n.id), h = C(
-          n.source,
-          n.sourcePort,
-          n.source === n.target ? { x: x.x + x.width, y: x.y + x.height / 3 } : k(x, a.sourceSide, y, a.offset),
-          n.source === n.target ? "EAST" : a.sourceSide
-        ), g = C(
-          n.target,
-          n.targetPort,
-          n.source === n.target ? {
-            x: y.x + y.width,
-            y: y.y + y.height * 2 / 3
-          } : k(y, a.targetSide, x, a.offset),
-          n.source === n.target ? "EAST" : a.targetSide
-        ), f = new s.ConnRef(i, h, g);
-        if (E(h), E(g), n.source === n.target) {
-          const w = r.get(n.source), M = new s.CheckpointVector();
-          for (const R of [w.y + w.height / 3, w.y + w.height * 2 / 3]) {
-            const T = new s.Point(w.x + w.width + Math.max(24, p + 4), R), A = new s.Checkpoint(T);
-            M.push_back(A), E(T), E(A);
+        const N = K(t, e).source, G = m.find((d) => d.side === N)?.position ?? m[0].position, W = new i.Point(G.x, G.y), z = new i.ConnEnd(W);
+        return S(W), z;
+      }, V = (t) => +!!(t.sourcePort || t.targetPort || t.source === t.target || O.get([t.source, t.target].sort().join("\0")) > 1), I = [...c].sort((t, e) => V(e) - V(t)).map((t) => {
+        const e = h.get(t.source), g = h.get(t.target), p = t.source === t.target, x = O.get([t.source, t.target].sort().join("\0")) > 1, w = J(
+          e,
+          g,
+          t.sourcePort,
+          E.get(t.id),
+          p ? { x: e.x + e.width, y: e.y + e.height / 3 } : void 0,
+          x
+        ), y = J(
+          g,
+          e,
+          t.targetPort,
+          E.get(t.id),
+          p ? {
+            x: g.x + g.width,
+            y: g.y + g.height * 2 / 3
+          } : void 0,
+          x
+        ), m = new i.ConnRef(s, w, y);
+        if (S(w), S(y), p) {
+          const N = new i.CheckpointVector();
+          for (const G of [
+            e.y + e.height / 3,
+            e.y + e.height * 2 / 3
+          ]) {
+            const W = new i.Point(
+              e.x + e.width + Math.max(24, a + 4),
+              G
+            ), z = new i.Checkpoint(W);
+            N.push_back(z), S(W), S(z);
           }
-          f.setRoutingCheckpoints(M), E(M);
+          m.setRoutingCheckpoints(N), S(N);
         }
-        return { edge: n, connection: f };
+        return { edge: t, connection: m };
       });
-      i.processTransaction();
-      for (const { edge: n, connection: x } of N) {
-        const y = x.displayRoute(), a = Array.from({ length: y.size() }, (h, g) => {
-          const f = y.at(g), w = { x: f.x, y: f.y };
-          return E(f), w;
+      s.processTransaction();
+      for (const { edge: t, connection: e } of I) {
+        const g = e.displayRoute(), p = Array.from({ length: g.size() }, (x, w) => {
+          const y = g.at(w), m = { x: y.x, y: y.y };
+          return S(y), m;
         });
-        if (E(y), !x.hasValidRoute() || a.length < 2 || a.some((h) => !Number.isFinite(h.x) || !Number.isFinite(h.y)) || a.some((h, g) => g > 0 && h.x !== a[g - 1].x && h.y !== a[g - 1].y))
-          throw new Error(`Graph edge cannot be routed: ${n.id}`);
-        S.set(n.id, a);
+        if (S(g), !e.hasValidRoute() || p.length < 2 || p.some((x) => !Number.isFinite(x.x) || !Number.isFinite(x.y)) || p.some((x, w) => w > 0 && x.x !== p[w - 1].x && x.y !== p[w - 1].y))
+          throw new Error(`Graph edge cannot be routed: ${t.id}`);
+        T.set(t.id, p);
       }
     } finally {
-      i.delete();
+      s.delete();
     }
   }
-  const H = t.edges.map((o) => ({ ...o, sections: [S.get(o.id)] }));
-  return X({
-    nodes: t.nodes,
-    edges: H,
-    bounds: t.bounds
+  const U = n.edges.map((r) => ({ ...r, sections: [T.get(r.id)] }));
+  return $({
+    nodes: n.nodes,
+    edges: U,
+    bounds: n.bounds
   });
 }
-function X(t) {
-  const c = [
-    ...t.nodes.flatMap((r) => [
-      { x: r.x, y: r.y },
-      { x: r.x + r.width, y: r.y + r.height }
+function $(n) {
+  const o = [
+    ...n.nodes.flatMap((h) => [
+      { x: h.x, y: h.y },
+      { x: h.x + h.width, y: h.y + h.height }
     ]),
-    ...t.edges.flatMap((r) => r.sections.flat())
-  ], p = Math.min(...c.map((r) => r.x)), s = Math.min(...c.map((r) => r.y));
+    ...n.edges.flatMap((h) => h.sections.flat())
+  ], a = Math.min(...o.map((h) => h.x)), i = Math.min(...o.map((h) => h.y));
   return {
-    nodes: t.nodes,
-    edges: t.edges,
+    nodes: n.nodes,
+    edges: n.edges,
     bounds: {
-      x: p,
-      y: s,
-      width: Math.max(...c.map((r) => r.x)) - p,
-      height: Math.max(...c.map((r) => r.y)) - s
+      x: a,
+      y: i,
+      width: Math.max(...o.map((h) => h.x)) - a,
+      height: Math.max(...o.map((h) => h.y)) - i
     }
   };
 }
-function W(t, c) {
+function q(n, o) {
   return {
-    x: c === "WEST" ? t.x : c === "EAST" ? t.x + t.width : t.x + t.width / 2,
-    y: c === "NORTH" ? t.y : c === "SOUTH" ? t.y + t.height : t.y + t.height / 2
+    x: o === "WEST" ? n.x : o === "EAST" ? n.x + n.width : n.x + n.width / 2,
+    y: o === "NORTH" ? n.y : o === "SOUTH" ? n.y + n.height : n.y + n.height / 2
   };
 }
-function D(t) {
-  return {
-    NORTH: "SOUTH",
-    EAST: "WEST",
-    SOUTH: "NORTH",
-    WEST: "EAST"
-  }[t];
-}
-function _(t, c, p, s, r, m, d) {
-  let S;
-  const H = (o, e, i) => i === "NORTH" ? e.x === o.x && e.y < o.y : i === "SOUTH" ? e.x === o.x && e.y > o.y : i === "WEST" ? e.y === o.y && e.x < o.x : e.y === o.y && e.x > o.x;
-  for (const o of m ? [m] : b)
-    for (const e of d ? [d] : b) {
-      const i = m ? W(t, o) : k(t, o, c, r), u = d ? W(c, e) : k(c, e, t, r), v = i.x === u.x || i.y === u.y ? [[i, u]] : [
-        [i, { x: u.x, y: i.y }, u],
-        [i, { x: i.x, y: u.y }, u]
-      ];
-      for (const l of v) {
-        if (p.includes(t) && !H(i, l[1], o) || p.includes(c) && !H(u, l.at(-2), e) || l.slice(1).some((O, P) => {
-          const C = l[P];
-          return p.some(
-            (N) => Math.max(C.x, O.x) > N.x && Math.min(C.x, O.x) < N.x + N.width && Math.max(C.y, O.y) > N.y && Math.min(C.y, O.y) < N.y + N.height
-          );
-        }))
-          continue;
-        const U = l.slice(1).reduce(
-          (O, P, C) => O + Math.abs(P.x - l[C].x) + Math.abs(P.y - l[C].y),
-          0
-        ) + (l.length - 2) * 32 + (o === s.source ? 0 : 16) + (e === s.target ? 0 : 16);
-        (!S || U < S.score) && (S = { source: o, target: e, score: U });
-      }
-    }
-  return S;
-}
-function z(t, c) {
-  const p = (e, i) => i.x >= e.x && i.y >= e.y && i.x + i.width <= e.x + e.width && i.y + i.height <= e.y + e.height, s = p(t, c) ? t : p(c, t) ? c : void 0;
-  if (s) {
-    const e = s === t ? c : t, i = {
-      NORTH: e.y - s.y,
-      EAST: s.x + s.width - e.x - e.width,
-      SOUTH: s.y + s.height - e.y - e.height,
-      WEST: e.x - s.x
-    }, u = [...b].sort((v, l) => i[v] - i[l])[0];
-    return { source: u, target: u };
+function K(n, o) {
+  const a = (c, s) => s.x >= c.x && s.y >= c.y && s.x + s.width <= c.x + c.width && s.y + s.height <= c.y + c.height, i = a(n, o) ? n : a(o, n) ? o : void 0;
+  if (i) {
+    const c = i === n ? o : n, s = {
+      NORTH: c.y - i.y,
+      EAST: i.x + i.width - c.x - c.width,
+      SOUTH: i.y + i.height - c.y - c.height,
+      WEST: c.x - i.x
+    }, M = [...A].sort((O, E) => s[O] - s[E])[0];
+    return { source: M, target: M };
   }
-  const r = c.x + c.width / 2 - (t.x + t.width / 2), m = c.y + c.height / 2 - (t.y + t.height / 2), d = Math.max(t.x - (c.x + c.width), c.x - (t.x + t.width), 0), S = Math.max(
-    t.y - (c.y + c.height),
-    c.y - (t.y + t.height),
+  const h = o.x + o.width / 2 - (n.x + n.width / 2), l = o.y + o.height / 2 - (n.y + n.height / 2), f = Math.max(n.x - (o.x + o.width), o.x - (n.x + n.width), 0), T = Math.max(
+    n.y - (o.y + o.height),
+    o.y - (n.y + n.height),
     0
-  ), o = (S === 0 && d > 0 ? !0 : d === 0 && S > 0 ? !1 : d === 0 && S === 0 ? Math.abs(r) >= Math.abs(m) : d <= S) ? r >= 0 ? "EAST" : "WEST" : m >= 0 ? "SOUTH" : "NORTH";
-  return { source: o, target: D(o) };
+  ), r = (T === 0 && f > 0 ? !0 : f === 0 && T > 0 ? !1 : f === 0 && T === 0 ? Math.abs(h) >= Math.abs(l) : f <= T) ? h >= 0 ? "EAST" : "WEST" : l >= 0 ? "SOUTH" : "NORTH";
+  return { source: r, target: A[(A.indexOf(r) + 2) % 4] };
 }
-function k(t, c, p, s = 0) {
-  const r = (o) => Math.min(8, o / 4), m = (o, e, i) => Math.max(e + r(i), Math.min(e + i - r(i), o)), d = (o, e, i, u) => {
-    const v = Math.max(o, i), l = Math.min(o + e, i + u);
-    return v < l ? (v + l) / 2 + s : void 0;
-  }, S = p.x + p.width / 2, H = p.y + p.height / 2;
-  switch (c) {
+function nt(n, o, a, i = 0) {
+  const h = (r) => Math.min(8, r / 4), l = (r, c, s) => Math.max(c + h(s), Math.min(c + s - h(s), r)), f = (r, c, s, M) => {
+    const O = Math.max(r, s), E = Math.min(r + c, s + M);
+    return O < E ? (O + E) / 2 + i : void 0;
+  }, T = a.x + a.width / 2, U = a.y + a.height / 2;
+  switch (o) {
     case "NORTH":
       return {
-        x: m(
-          d(t.x, t.width, p.x, p.width) ?? S + s,
-          t.x,
-          t.width
+        x: l(
+          f(n.x, n.width, a.x, a.width) ?? T + i,
+          n.x,
+          n.width
         ),
-        y: t.y
+        y: n.y
       };
     case "EAST":
       return {
-        x: t.x + t.width,
-        y: m(
-          d(t.y, t.height, p.y, p.height) ?? H + s,
-          t.y,
-          t.height
+        x: n.x + n.width,
+        y: l(
+          f(n.y, n.height, a.y, a.height) ?? U + i,
+          n.y,
+          n.height
         )
       };
     case "SOUTH":
       return {
-        x: m(
-          d(t.x, t.width, p.x, p.width) ?? S + s,
-          t.x,
-          t.width
+        x: l(
+          f(n.x, n.width, a.x, a.width) ?? T + i,
+          n.x,
+          n.width
         ),
-        y: t.y + t.height
+        y: n.y + n.height
       };
     case "WEST":
       return {
-        x: t.x,
-        y: m(
-          d(t.y, t.height, p.y, p.height) ?? H + s,
-          t.y,
-          t.height
+        x: n.x,
+        y: l(
+          f(n.y, n.height, a.y, a.height) ?? U + i,
+          n.y,
+          n.height
         )
       };
   }
 }
 export {
-  I as routeGraphGeometry
+  et as routeGraphGeometry
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@floegence/floe-webapp-core",
-  "version": "0.86.12",
+  "version": "0.86.13",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",