@visulima/vis 1.0.0-alpha.29 → 1.0.0-alpha.30

package/dist/packem_chunks/handler45.js

@@ -1,4 +1,4 @@
-var Fr=Object.defineProperty;var b=(n,e)=>Fr(n,"name",{value:e,configurable:!0});import{createRequire as Pr}from"node:module";import{E as ie,j as le,q as ft}from"../packem_shared/Table-3pFgIUZ2-DABgc6rj.js";import{projectGraphToDot as Hr}from"@visulima/task-runner";import{a5 as h,a6 as $,n as y,aG as Vr,aH as Kr,aI as Xr,aF as Yr,w as te,af as Qr,aJ as Jr,aK as mt,C as Zr,S as ei,k as ti,R as ri,s as ii}from"./bin.js";import{g as di}from"../packem_shared/_commonjsHelpers-CLblCigl.js";import{d as ci}from"../packem_shared/anolilab-text-CAM_E6uK.js";const Wr=Pr(import.meta.url),_e=typeof globalThis<"u"&&typeof globalThis.process<"u"?globalThis.process:process,qe=b(n=>{if(typeof _e<"u"&&_e.versions&&_e.versions.node){const[e,t]=_e.versions.node.split(".").map(Number);if(e>22||e===22&&t>=3||e===20&&t>=16)return _e.getBuiltinModule(n)}return Wr(n)},"__cjs_getBuiltinModule"),{readFileSync:qr,writeFileSync:Br}=qe("node:fs"),{createRequire:ni}=qe("node:module"),{join:oi,dirname:ai}=qe("node:path"),{EventEmitter:si}=qe("events");var li=Object.defineProperty,w=b((n,e)=>li(n,"name",{value:e,configurable:!0}),"h");function _t(){const n=arguments[0];for(let e=1,t=arguments.length;e<t;e++)if(arguments[e])for(const r in arguments[e])n[r]=arguments[e][r];return n}b(_t,"ft");w(_t,"assignPolyfill");let H=_t;typeof Object.assign=="function"&&(H=Object.assign);function Z(n,e,t,r){const i=n._nodes.get(e);let o=null;return i&&(r==="mixed"?o=i.out&&i.out[t]||i.undirected&&i.undirected[t]:r==="directed"?o=i.out&&i.out[t]:o=i.undirected&&i.undirected[t]),o}b(Z,"D$1");w(Z,"getMatchingEdge");function V(n){return typeof n=="object"&&n!==null}b(V,"G$1");w(V,"isPlainObject");function st(n){let e;for(e in n)return!1;return!0}b(st,"tt");w(st,"isEmpty");function J(n,e,t){Object.defineProperty(n,e,{enumerable:!1,configurable:!1,writable:!0,value:t})}b(J,"x");w(J,"privateProperty");function re(n,e,t){const r={enumerable:!0,configurable:!0};typeof t=="function"?r.get=t:(r.value=t,r.writable=!1),Object.defineProperty(n,e,r)}b(re,"A$1");w(re,"readOnlyProperty");function nt(n){return!(!V(n)||n.attributes&&!Array.isArray(n.attributes))}b(nt,"Q");w(nt,"validateHints");function Dt(){let n=Math.floor(Math.random()*256)&255;return()=>n++}b(Dt,"pt");w(Dt,"incrementalIdStartingFromRandomByte");function oe(){const n=arguments;let e=null,t=-1;return{[Symbol.iterator](){return this},next(){let r=null;do{if(e===null){if(t++,t>=n.length)return{done:!0};e=n[t][Symbol.iterator]()}if(r=e.next(),r.done){e=null;continue}break}while(!0);return r}}}b(oe,"N$1");w(oe,"chain");function me(){return{[Symbol.iterator](){return this},next(){return{done:!0}}}}b(me,"L$2");w(me,"emptyIterator");let dt=class extends Error{static{b(this,"P")}static{w(this,"GraphError")}constructor(e){super(),this.name="GraphError",this.message=e}},E=class Mt extends dt{static{b(this,"g")}static{w(this,"InvalidArgumentsGraphError")}constructor(e){super(e),this.name="InvalidArgumentsGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,Mt.prototype.constructor)}},v=class It extends dt{static{b(this,"p")}static{w(this,"NotFoundGraphError")}constructor(e){super(e),this.name="NotFoundGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,It.prototype.constructor)}},C=class Lt extends dt{static{b(this,"y")}static{w(this,"UsageGraphError")}constructor(e){super(e),this.name="UsageGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,Lt.prototype.constructor)}};function ct(n,e){this.key=n,this.attributes=e,this.clear()}b(ct,"et");w(ct,"MixedNodeData");ct.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.undirectedDegree=0,this.undirectedLoops=0,this.directedLoops=0,this.in={},this.out={},this.undirected={}};function lt(n,e){this.key=n,this.attributes=e,this.clear()}b(lt,"it");w(lt,"DirectedNodeData");lt.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.directedLoops=0,this.in={},this.out={}};function ht(n,e){this.key=n,this.attributes=e,this.clear()}b(ht,"nt");w(ht,"UndirectedNodeData");ht.prototype.clear=function(){this.undirectedDegree=0,this.undirectedLoops=0,this.undirected={}};function be(n,e,t,r,i){this.key=e,this.attributes=i,this.undirected=n,this.source=t,this.target=r}b(be,"M$1");w(be,"EdgeData");be.prototype.attach=function(){let n="out",e="in";this.undirected&&(n=e="undirected");const t=this.source.key,r=this.target.key;this.source[n][r]=this,!(this.undirected&&t===r)&&(this.target[e][t]=this)};be.prototype.attachMulti=function(){let n="out",e="in";const t=this.source.key,r=this.target.key;this.undirected&&(n=e="undirected");const i=this.source[n],o=i[r];if(typeof o>"u"){i[r]=this,this.undirected&&t===r||(this.target[e][t]=this);return}o.previous=this,this.next=o,i[r]=this,this.target[e][t]=this};be.prototype.detach=function(){const n=this.source.key,e=this.target.key;let t="out",r="in";this.undirected&&(t=r="undirected"),delete this.source[t][e],delete this.target[r][n]};be.prototype.detachMulti=function(){const n=this.source.key,e=this.target.key;let t="out",r="in";this.undirected&&(t=r="undirected"),this.previous===void 0?this.next===void 0?(delete this.source[t][e],delete this.target[r][n]):(this.next.previous=void 0,this.source[t][e]=this.next,this.target[r][n]=this.next):(this.previous.next=this.next,this.next!==void 0&&(this.next.previous=this.previous))};const Tt=0,Ot=1,hi=2,zt=3;function ae(n,e,t,r,i,o,a){let s,d,c,u;if(r=""+r,t===Tt){if(s=n._nodes.get(r),!s)throw new v(`Graph.${e}: could not find the "${r}" node in the graph.`);c=i,u=o}else if(t===zt){if(i=""+i,d=n._edges.get(i),!d)throw new v(`Graph.${e}: could not find the "${i}" edge in the graph.`);const l=d.source.key,g=d.target.key;if(r===l)s=d.target;else if(r===g)s=d.source;else throw new v(`Graph.${e}: the "${r}" node is not attached to the "${i}" edge (${l}, ${g}).`);c=o,u=a}else{if(d=n._edges.get(r),!d)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`);t===Ot?s=d.source:s=d.target,c=i,u=o}return[s,c,u]}b(ae,"S$2");w(ae,"findRelevantNodeData");function Rt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return a.attributes[s]}}b(Rt,"gt");w(Rt,"attachNodeAttributeGetter");function Ut(n,e,t){n.prototype[e]=function(r,i){const[o]=ae(this,e,t,r,i);return o.attributes}}b(Ut,"yt");w(Ut,"attachNodeAttributesGetter");function Ft(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return a.attributes.hasOwnProperty(s)}}b(Ft,"wt");w(Ft,"attachNodeAttributeChecker");function Pt(n,e,t){n.prototype[e]=function(r,i,o,a){const[s,d,c]=ae(this,e,t,r,i,o,a);return s.attributes[d]=c,this.emit("nodeAttributesUpdated",{key:s.key,type:"set",attributes:s.attributes,name:d}),this}}b(Pt,"mt");w(Pt,"attachNodeAttributeSetter");function Wt(n,e,t){n.prototype[e]=function(r,i,o,a){const[s,d,c]=ae(this,e,t,r,i,o,a);if(typeof c!="function")throw new E(`Graph.${e}: updater should be a function.`);const u=s.attributes,l=c(u[d]);return u[d]=l,this.emit("nodeAttributesUpdated",{key:s.key,type:"set",attributes:s.attributes,name:d}),this}}b(Wt,"bt");w(Wt,"attachNodeAttributeUpdater");function qt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return delete a.attributes[s],this.emit("nodeAttributesUpdated",{key:a.key,type:"remove",attributes:a.attributes,name:s}),this}}b(qt,"$t");w(qt,"attachNodeAttributeRemover");function Bt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(!V(s))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return a.attributes=s,this.emit("nodeAttributesUpdated",{key:a.key,type:"replace",attributes:a.attributes}),this}}b(Bt,"Gt");w(Bt,"attachNodeAttributesReplacer");function Ht(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(!V(s))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return H(a.attributes,s),this.emit("nodeAttributesUpdated",{key:a.key,type:"merge",attributes:a.attributes,data:s}),this}}b(Ht,"Et");w(Ht,"attachNodeAttributesMerger");function Vt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(typeof s!="function")throw new E(`Graph.${e}: provided updater is not a function.`);return a.attributes=s(a.attributes),this.emit("nodeAttributesUpdated",{key:a.key,type:"update",attributes:a.attributes}),this}}b(Vt,"kt");w(Vt,"attachNodeAttributesUpdater");const pi=[{name:w(n=>`get${n}Attribute`,"name"),attacher:Rt},{name:w(n=>`get${n}Attributes`,"name"),attacher:Ut},{name:w(n=>`has${n}Attribute`,"name"),attacher:Ft},{name:w(n=>`set${n}Attribute`,"name"),attacher:Pt},{name:w(n=>`update${n}Attribute`,"name"),attacher:Wt},{name:w(n=>`remove${n}Attribute`,"name"),attacher:qt},{name:w(n=>`replace${n}Attributes`,"name"),attacher:Bt},{name:w(n=>`merge${n}Attributes`,"name"),attacher:Ht},{name:w(n=>`update${n}Attributes`,"name"),attacher:Vt}];function Kt(n){pi.forEach(function({name:e,attacher:t}){t(n,e("Node"),Tt),t(n,e("Source"),Ot),t(n,e("Target"),hi),t(n,e("Opposite"),zt)})}b(Kt,"xt");w(Kt,"attachNodeAttributesMethods");function Xt(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return o.attributes[i]}}b(Xt,"Dt");w(Xt,"attachEdgeAttributeGetter");function Yt(n,e,t){n.prototype[e]=function(r){let i;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>1){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const o=""+r,a=""+arguments[1];if(i=Z(this,o,a,t),!i)throw new v(`Graph.${e}: could not find an edge for the given path ("${o}" - "${a}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,i=this._edges.get(r),!i)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return i.attributes}}b(Yt,"At");w(Yt,"attachEdgeAttributesGetter");function Qt(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return o.attributes.hasOwnProperty(i)}}b(Qt,"vt");w(Qt,"attachEdgeAttributeChecker");function Jt(n,e,t){n.prototype[e]=function(r,i,o){let a;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>3){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const s=""+r,d=""+i;if(i=arguments[2],o=arguments[3],a=Z(this,s,d,t),!a)throw new v(`Graph.${e}: could not find an edge for the given path ("${s}" - "${d}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,a=this._edges.get(r),!a)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return a.attributes[i]=o,this.emit("edgeAttributesUpdated",{key:a.key,type:"set",attributes:a.attributes,name:i}),this}}b(Jt,"Nt");w(Jt,"attachEdgeAttributeSetter");function Zt(n,e,t){n.prototype[e]=function(r,i,o){let a;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>3){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const s=""+r,d=""+i;if(i=arguments[2],o=arguments[3],a=Z(this,s,d,t),!a)throw new v(`Graph.${e}: could not find an edge for the given path ("${s}" - "${d}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,a=this._edges.get(r),!a)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(typeof o!="function")throw new E(`Graph.${e}: updater should be a function.`);return a.attributes[i]=o(a.attributes[i]),this.emit("edgeAttributesUpdated",{key:a.key,type:"set",attributes:a.attributes,name:i}),this}}b(Zt,"St");w(Zt,"attachEdgeAttributeUpdater");function er(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return delete o.attributes[i],this.emit("edgeAttributesUpdated",{key:o.key,type:"remove",attributes:o.attributes,name:i}),this}}b(er,"Ut");w(er,"attachEdgeAttributeRemover");function tr(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(!V(i))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return o.attributes=i,this.emit("edgeAttributesUpdated",{key:o.key,type:"replace",attributes:o.attributes}),this}}b(tr,"Lt");w(tr,"attachEdgeAttributesReplacer");function rr(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(!V(i))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return H(o.attributes,i),this.emit("edgeAttributesUpdated",{key:o.key,type:"merge",attributes:o.attributes,data:i}),this}}b(rr,"Mt");w(rr,"attachEdgeAttributesMerger");function ir(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(typeof i!="function")throw new E(`Graph.${e}: provided updater is not a function.`);return o.attributes=i(o.attributes),this.emit("edgeAttributesUpdated",{key:o.key,type:"update",attributes:o.attributes}),this}}b(ir,"Ct");w(ir,"attachEdgeAttributesUpdater");const ui=[{name:w(n=>`get${n}Attribute`,"name"),attacher:Xt},{name:w(n=>`get${n}Attributes`,"name"),attacher:Yt},{name:w(n=>`has${n}Attribute`,"name"),attacher:Qt},{name:w(n=>`set${n}Attribute`,"name"),attacher:Jt},{name:w(n=>`update${n}Attribute`,"name"),attacher:Zt},{name:w(n=>`remove${n}Attribute`,"name"),attacher:er},{name:w(n=>`replace${n}Attributes`,"name"),attacher:tr},{name:w(n=>`merge${n}Attributes`,"name"),attacher:rr},{name:w(n=>`update${n}Attributes`,"name"),attacher:ir}];function nr(n){ui.forEach(function({name:e,attacher:t}){t(n,e("Edge"),"mixed"),t(n,e("DirectedEdge"),"directed"),t(n,e("UndirectedEdge"),"undirected")})}b(nr,"It");w(nr,"attachEdgeAttributesMethods");const gi=[{name:"edges",type:"mixed"},{name:"inEdges",type:"directed",direction:"in"},{name:"outEdges",type:"directed",direction:"out"},{name:"inboundEdges",type:"mixed",direction:"in"},{name:"outboundEdges",type:"mixed",direction:"out"},{name:"directedEdges",type:"directed"},{name:"undirectedEdges",type:"undirected"}];function or(n,e,t,r){let i=!1;for(const o in e){if(o===r)continue;const a=e[o];if(i=t(a.key,a.attributes,a.source.key,a.target.key,a.source.attributes,a.target.attributes,a.undirected),n&&i)return a.key}}b(or,"Ot");w(or,"forEachSimple");function ar(n,e,t,r){let i,o,a,s=!1;for(const d in e)if(d!==r){i=e[d];do{if(o=i.source,a=i.target,s=t(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected),n&&s)return i.key;i=i.next}while(i!==void 0)}}b(ar,"Wt");w(ar,"forEachMulti");function Pe(n,e){const t=Object.keys(n),r=t.length;let i,o=0;return{[Symbol.iterator](){return this},next(){do if(i)i=i.next;else{if(o>=r)return{done:!0};const a=t[o++];if(a===e){i=void 0;continue}i=n[a]}while(!i);return{done:!1,value:{edge:i.key,attributes:i.attributes,source:i.source.key,target:i.target.key,sourceAttributes:i.source.attributes,targetAttributes:i.target.attributes,undirected:i.undirected}}}}}b(Pe,"K");w(Pe,"createIterator");function sr(n,e,t,r){const i=e[t];if(!i)return;const o=i.source,a=i.target;if(r(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected)&&n)return i.key}b(sr,"Kt");w(sr,"forEachForKeySimple");function dr(n,e,t,r){let i=e[t];if(!i)return;let o=!1;do{if(o=r(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected),n&&o)return i.key;i=i.next}while(i!==void 0)}b(dr,"Tt");w(dr,"forEachForKeyMulti");function We(n,e){let t=n[e];if(t.next!==void 0)return{[Symbol.iterator](){return this},next(){if(!t)return{done:!0};const i={edge:t.key,attributes:t.attributes,source:t.source.key,target:t.target.key,sourceAttributes:t.source.attributes,targetAttributes:t.target.attributes,undirected:t.undirected};return t=t.next,{done:!1,value:i}}};let r=!1;return{[Symbol.iterator](){return this},next(){return r===!0?{done:!0}:(r=!0,{done:!1,value:{edge:t.key,attributes:t.attributes,source:t.source.key,target:t.target.key,sourceAttributes:t.source.attributes,targetAttributes:t.target.attributes,undirected:t.undirected}})}}}b(We,"T$3");w(We,"createIteratorForKey");function cr(n,e){if(n.size===0)return[];if(e==="mixed"||e===n.type)return Array.from(n._edges.keys());const t=e==="undirected"?n.undirectedSize:n.directedSize,r=new Array(t),i=e==="undirected",o=n._edges.values();let a=0,s,d;for(;s=o.next(),s.done!==!0;)d=s.value,d.undirected===i&&(r[a++]=d.key);return r}b(cr,"Pt");w(cr,"createEdgeArray");function pt(n,e,t,r){if(e.size===0)return;const i=t!=="mixed"&&t!==e.type,o=t==="undirected";let a,s,d=!1;const c=e._edges.values();for(;a=c.next(),a.done!==!0;){if(s=a.value,i&&s.undirected!==o)continue;const{key:u,attributes:l,source:g,target:x}=s;if(d=r(u,l,g.key,x.key,g.attributes,x.attributes,s.undirected),n&&d)return u}}b(pt,"at");w(pt,"forEachEdge");function lr(n,e){if(n.size===0)return me();const t=e!=="mixed"&&e!==n.type,r=e==="undirected",i=n._edges.values();return{[Symbol.iterator](){return this},next(){let o,a;for(;;){if(o=i.next(),o.done)return o;if(a=o.value,!(t&&a.undirected!==r))break}return{value:{edge:a.key,attributes:a.attributes,source:a.source.key,target:a.target.key,sourceAttributes:a.source.attributes,targetAttributes:a.target.attributes,undirected:a.undirected},done:!1}}}}b(lr,"Ft");w(lr,"createEdgeIterator");function Be(n,e,t,r,i,o){const a=e?ar:or;let s;if(t!=="undirected"&&(r!=="out"&&(s=a(n,i.in,o),n&&s)||r!=="in"&&(s=a(n,i.out,o,r?void 0:i.key),n&&s))||t!=="directed"&&(s=a(n,i.undirected,o),n&&s))return s}b(Be,"F$1");w(Be,"forEachEdgeForNode");function hr(n,e,t,r){const i=[];return Be(!1,n,e,t,r,function(o){i.push(o)}),i}b(hr,"Bt");w(hr,"createEdgeArrayForNode");function pr(n,e,t){let r=me();return n!=="undirected"&&(e!=="out"&&typeof t.in<"u"&&(r=oe(r,Pe(t.in))),e!=="in"&&typeof t.out<"u"&&(r=oe(r,Pe(t.out,e?void 0:t.key)))),n!=="directed"&&typeof t.undirected<"u"&&(r=oe(r,Pe(t.undirected))),r}b(pr,"Rt");w(pr,"createEdgeIteratorForNode");function He(n,e,t,r,i,o,a){const s=t?dr:sr;let d;if(e!=="undirected"&&(typeof i.in<"u"&&r!=="out"&&(d=s(n,i.in,o,a),n&&d)||typeof i.out<"u"&&r!=="in"&&(r||i.key!==o)&&(d=s(n,i.out,o,a),n&&d))||e!=="directed"&&typeof i.undirected<"u"&&(d=s(n,i.undirected,o,a),n&&d))return d}b(He,"B");w(He,"forEachEdgeForPath");function ur(n,e,t,r,i){const o=[];return He(!1,n,e,t,r,i,function(a){o.push(a)}),o}b(ur,"Yt");w(ur,"createEdgeArrayForPath");function gr(n,e,t,r){let i=me();return n!=="undirected"&&(typeof t.in<"u"&&e!=="out"&&r in t.in&&(i=oe(i,We(t.in,r))),typeof t.out<"u"&&e!=="in"&&r in t.out&&(e||t.key!==r)&&(i=oe(i,We(t.out,r)))),n!=="directed"&&typeof t.undirected<"u"&&r in t.undirected&&(i=oe(i,We(t.undirected,r))),i}b(gr,"Ht");w(gr,"createEdgeIteratorForPath");function fr(n,e){const{name:t,type:r,direction:i}=e;n.prototype[t]=function(o,a){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return[];if(!arguments.length)return cr(this,r);if(arguments.length===1){o=""+o;const s=this._nodes.get(o);if(typeof s>"u")throw new v(`Graph.${t}: could not find the "${o}" node in the graph.`);return hr(this.multi,r==="mixed"?this.type:r,i,s)}if(arguments.length===2){o=""+o,a=""+a;const s=this._nodes.get(o);if(!s)throw new v(`Graph.${t}:  could not find the "${o}" source node in the graph.`);if(!this._nodes.has(a))throw new v(`Graph.${t}:  could not find the "${a}" target node in the graph.`);return ur(r,this.multi,i,s,a)}throw new E(`Graph.${t}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`)}}b(fr,"Jt");w(fr,"attachEdgeArrayCreator");function mr(n,e){const{name:t,type:r,direction:i}=e,o="forEach"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(c,u,l){if(!(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)){if(arguments.length===1)return l=c,pt(!1,this,r,l);if(arguments.length===2){c=""+c,l=u;const g=this._nodes.get(c);if(typeof g>"u")throw new v(`Graph.${o}: could not find the "${c}" node in the graph.`);return Be(!1,this.multi,r==="mixed"?this.type:r,i,g,l)}if(arguments.length===3){c=""+c,u=""+u;const g=this._nodes.get(c);if(!g)throw new v(`Graph.${o}:  could not find the "${c}" source node in the graph.`);if(!this._nodes.has(u))throw new v(`Graph.${o}:  could not find the "${u}" target node in the graph.`);return He(!1,r,this.multi,i,g,u,l)}throw new E(`Graph.${o}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`)}};const a="map"+t[0].toUpperCase()+t.slice(1);n.prototype[a]=function(){const c=Array.prototype.slice.call(arguments),u=c.pop();let l;if(c.length===0){let g=0;r!=="directed"&&(g+=this.undirectedSize),r!=="undirected"&&(g+=this.directedSize),l=new Array(g);let x=0;c.push((j,A,G,D,R,U,T)=>{l[x++]=u(j,A,G,D,R,U,T)})}else l=[],c.push((g,x,j,A,G,D,R)=>{l.push(u(g,x,j,A,G,D,R))});return this[o].apply(this,c),l};const s="filter"+t[0].toUpperCase()+t.slice(1);n.prototype[s]=function(){const c=Array.prototype.slice.call(arguments),u=c.pop(),l=[];return c.push((g,x,j,A,G,D,R)=>{u(g,x,j,A,G,D,R)&&l.push(g)}),this[o].apply(this,c),l};const d="reduce"+t[0].toUpperCase()+t.slice(1);n.prototype[d]=function(){let c=Array.prototype.slice.call(arguments);if(c.length<2||c.length>4)throw new E(`Graph.${d}: invalid number of arguments (expecting 2, 3 or 4 and got ${c.length}).`);if(typeof c[c.length-1]=="function"&&typeof c[c.length-2]!="function")throw new E(`Graph.${d}: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.`);let u,l;c.length===2?(u=c[0],l=c[1],c=[]):c.length===3?(u=c[1],l=c[2],c=[c[0]]):c.length===4&&(u=c[2],l=c[3],c=[c[0],c[1]]);let g=l;return c.push((x,j,A,G,D,R,U)=>{g=u(g,x,j,A,G,D,R,U)}),this[o].apply(this,c),g}}b(mr,"Vt");w(mr,"attachForEachEdge");function br(n,e){const{name:t,type:r,direction:i}=e,o="find"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(d,c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return!1;if(arguments.length===1)return u=d,pt(!0,this,r,u);if(arguments.length===2){d=""+d,u=c;const l=this._nodes.get(d);if(typeof l>"u")throw new v(`Graph.${o}: could not find the "${d}" node in the graph.`);return Be(!0,this.multi,r==="mixed"?this.type:r,i,l,u)}if(arguments.length===3){d=""+d,c=""+c;const l=this._nodes.get(d);if(!l)throw new v(`Graph.${o}:  could not find the "${d}" source node in the graph.`);if(!this._nodes.has(c))throw new v(`Graph.${o}:  could not find the "${c}" target node in the graph.`);return He(!0,r,this.multi,i,l,c,u)}throw new E(`Graph.${o}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`)};const a="some"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[a]=function(){const d=Array.prototype.slice.call(arguments),c=d.pop();return d.push((u,l,g,x,j,A,G)=>c(u,l,g,x,j,A,G)),!!this[o].apply(this,d)};const s="every"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[s]=function(){const d=Array.prototype.slice.call(arguments),c=d.pop();return d.push((u,l,g,x,j,A,G)=>!c(u,l,g,x,j,A,G)),!this[o].apply(this,d)}}b(br,"qt");w(br,"attachFindEdge");function wr(n,e){const{name:t,type:r,direction:i}=e,o=t.slice(0,-1)+"Entries";n.prototype[o]=function(a,s){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return me();if(!arguments.length)return lr(this,r);if(arguments.length===1){a=""+a;const d=this._nodes.get(a);if(!d)throw new v(`Graph.${o}: could not find the "${a}" node in the graph.`);return pr(r,i,d)}if(arguments.length===2){a=""+a,s=""+s;const d=this._nodes.get(a);if(!d)throw new v(`Graph.${o}:  could not find the "${a}" source node in the graph.`);if(!this._nodes.has(s))throw new v(`Graph.${o}:  could not find the "${s}" target node in the graph.`);return gr(r,i,d,s)}throw new E(`Graph.${o}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`)}}b(wr,"Qt");w(wr,"attachEdgeIteratorCreator");function yr(n){gi.forEach(e=>{fr(n,e),mr(n,e),br(n,e),wr(n,e)})}b(yr,"Xt");w(yr,"attachEdgeIterationMethods");const fi=[{name:"neighbors",type:"mixed"},{name:"inNeighbors",type:"directed",direction:"in"},{name:"outNeighbors",type:"directed",direction:"out"},{name:"inboundNeighbors",type:"mixed",direction:"in"},{name:"outboundNeighbors",type:"mixed",direction:"out"},{name:"directedNeighbors",type:"directed"},{name:"undirectedNeighbors",type:"undirected"}];function Ie(){this.A=null,this.B=null}b(Ie,"W");w(Ie,"CompositeSetWrapper");Ie.prototype.wrap=function(n){this.A===null?this.A=n:this.B===null&&(this.B=n)};Ie.prototype.has=function(n){return this.A!==null&&n in this.A||this.B!==null&&n in this.B};function $e(n,e,t,r,i){for(const o in r){const a=r[o],s=a.source,d=a.target,c=s===t?d:s;if(e&&e.has(c.key))continue;const u=i(c.key,c.attributes);if(n&&u)return c.key}}b($e,"I$1");w($e,"forEachInObjectOnce");function Ve(n,e,t,r,i){if(e!=="mixed"){if(e==="undirected")return $e(n,null,r,r.undirected,i);if(typeof t=="string")return $e(n,null,r,r[t],i)}const o=new Ie;let a;if(e!=="undirected"){if(t!=="out"){if(a=$e(n,null,r,r.in,i),n&&a)return a;o.wrap(r.in)}if(t!=="in"){if(a=$e(n,o,r,r.out,i),n&&a)return a;o.wrap(r.out)}}if(e!=="directed"&&(a=$e(n,o,r,r.undirected,i),n&&a))return a}b(Ve,"R$1");w(Ve,"forEachNeighbor");function xr(n,e,t){if(n!=="mixed"){if(n==="undirected")return Object.keys(t.undirected);if(typeof e=="string")return Object.keys(t[e])}const r=[];return Ve(!1,n,e,t,function(i){r.push(i)}),r}b(xr,"te$1");w(xr,"createNeighborArrayForNode");function Ge(n,e,t){const r=Object.keys(t),i=r.length;let o=0;return{[Symbol.iterator](){return this},next(){let a=null;do{if(o>=i)return n&&n.wrap(t),{done:!0};const s=t[r[o++]],d=s.source,c=s.target;if(a=d===e?c:d,n&&n.has(a.key)){a=null;continue}}while(a===null);return{done:!1,value:{neighbor:a.key,attributes:a.attributes}}}}}b(Ge,"j");w(Ge,"createDedupedObjectIterator");function vr(n,e,t){if(n!=="mixed"){if(n==="undirected")return Ge(null,t,t.undirected);if(typeof e=="string")return Ge(null,t,t[e])}let r=me();const i=new Ie;return n!=="undirected"&&(e!=="out"&&(r=oe(r,Ge(i,t,t.in))),e!=="in"&&(r=oe(r,Ge(i,t,t.out)))),n!=="directed"&&(r=oe(r,Ge(i,t,t.undirected))),r}b(vr,"ee$1");w(vr,"createNeighborIterator");function kr(n,e){const{name:t,type:r,direction:i}=e;n.prototype[t]=function(o){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return[];o=""+o;const a=this._nodes.get(o);if(typeof a>"u")throw new v(`Graph.${t}: could not find the "${o}" node in the graph.`);return xr(r==="mixed"?this.type:r,i,a)}}b(kr,"ie");w(kr,"attachNeighborArrayCreator");function Er(n,e){const{name:t,type:r,direction:i}=e,o="forEach"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return;c=""+c;const l=this._nodes.get(c);if(typeof l>"u")throw new v(`Graph.${o}: could not find the "${c}" node in the graph.`);Ve(!1,r==="mixed"?this.type:r,i,l,u)};const a="map"+t[0].toUpperCase()+t.slice(1);n.prototype[a]=function(c,u){const l=[];return this[o](c,(g,x)=>{l.push(u(g,x))}),l};const s="filter"+t[0].toUpperCase()+t.slice(1);n.prototype[s]=function(c,u){const l=[];return this[o](c,(g,x)=>{u(g,x)&&l.push(g)}),l};const d="reduce"+t[0].toUpperCase()+t.slice(1);n.prototype[d]=function(c,u,l){if(arguments.length<3)throw new E(`Graph.${d}: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.`);let g=l;return this[o](c,(x,j)=>{g=u(g,x,j)}),g}}b(Er,"ne");w(Er,"attachForEachNeighbor");function $r(n,e){const{name:t,type:r,direction:i}=e,o=t[0].toUpperCase()+t.slice(1,-1),a="find"+o;n.prototype[a]=function(c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return;c=""+c;const l=this._nodes.get(c);if(typeof l>"u")throw new v(`Graph.${a}: could not find the "${c}" node in the graph.`);return Ve(!0,r==="mixed"?this.type:r,i,l,u)};const s="some"+o;n.prototype[s]=function(c,u){return!!this[a](c,u)};const d="every"+o;n.prototype[d]=function(c,u){return!this[a](c,(l,g)=>!u(l,g))}}b($r,"re");w($r,"attachFindNeighbor");function Gr(n,e){const{name:t,type:r,direction:i}=e,o=t.slice(0,-1)+"Entries";n.prototype[o]=function(a){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return me();a=""+a;const s=this._nodes.get(a);if(typeof s>"u")throw new v(`Graph.${o}: could not find the "${a}" node in the graph.`);return vr(r==="mixed"?this.type:r,i,s)}}b(Gr,"oe");w(Gr,"attachNeighborIteratorCreator");function jr(n){fi.forEach(e=>{kr(n,e),Er(n,e),$r(n,e),Gr(n,e)})}b(jr,"se");w(jr,"attachNeighborIterationMethods");function Me(n,e,t,r,i){const o=r._nodes.values(),a=r.type;let s,d,c,u,l,g,x;for(;s=o.next(),s.done!==!0;){let j=!1;if(d=s.value,a!=="undirected"){u=d.out;for(c in u){l=u[c];do{if(g=l.target,j=!0,x=i(d.key,g.key,d.attributes,g.attributes,l.key,l.attributes,l.undirected),n&&x)return l;l=l.next}while(l)}}if(a!=="directed"){u=d.undirected;for(c in u)if(!(e&&d.key>c)){l=u[c];do{if(g=l.target,g.key!==c&&(g=l.source),j=!0,x=i(d.key,g.key,d.attributes,g.attributes,l.key,l.attributes,l.undirected),n&&x)return l;l=l.next}while(l)}}if(t&&!j&&(x=i(d.key,null,d.attributes,null,null,null,null),n&&x))return null}}b(Me,"O");w(Me,"forEachAdjacency");function Ar(n,e){const t={key:n};return st(e.attributes)||(t.attributes=H({},e.attributes)),t}b(Ar,"ae");w(Ar,"serializeNode");function Sr(n,e,t){const r={key:e,source:t.source.key,target:t.target.key};return st(t.attributes)||(r.attributes=H({},t.attributes)),n==="mixed"&&t.undirected&&(r.undirected=!0),r}b(Sr,"ue");w(Sr,"serializeEdge");function Nr(n){if(!V(n))throw new E('Graph.import: invalid serialized node. A serialized node should be a plain object with at least a "key" property.');if(!("key"in n))throw new E("Graph.import: serialized node is missing its key.");if("attributes"in n&&(!V(n.attributes)||n.attributes===null))throw new E("Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.")}b(Nr,"de");w(Nr,"validateSerializedNode");function Cr(n){if(!V(n))throw new E('Graph.import: invalid serialized edge. A serialized edge should be a plain object with at least a "source" & "target" property.');if(!("source"in n))throw new E("Graph.import: serialized edge is missing its source.");if(!("target"in n))throw new E("Graph.import: serialized edge is missing its target.");if("attributes"in n&&(!V(n.attributes)||n.attributes===null))throw new E("Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.");if("undirected"in n&&typeof n.undirected!="boolean")throw new E("Graph.import: invalid undirectedness information. Undirected should be boolean or omitted.")}b(Cr,"he");w(Cr,"validateSerializedEdge");const mi=Dt(),bi=new Set(["directed","undirected","mixed"]),bt=new Set(["domain","_events","_eventsCount","_maxListeners"]),wi=[{name:w(n=>`${n}Edge`,"name"),generateKey:!0},{name:w(n=>`${n}DirectedEdge`,"name"),generateKey:!0,type:"directed"},{name:w(n=>`${n}UndirectedEdge`,"name"),generateKey:!0,type:"undirected"},{name:w(n=>`${n}EdgeWithKey`,"name")},{name:w(n=>`${n}DirectedEdgeWithKey`,"name"),type:"directed"},{name:w(n=>`${n}UndirectedEdgeWithKey`,"name"),type:"undirected"}],yi={allowSelfLoops:!0,multi:!1,type:"mixed"};function _r(n,e,t){if(t&&!V(t))throw new E(`Graph.addNode: invalid attributes. Expecting an object but got "${t}"`);if(e=""+e,t=t||{},n._nodes.has(e))throw new C(`Graph.addNode: the "${e}" node already exist in the graph.`);const r=new n.NodeDataClass(e,t);return n._nodes.set(e,r),n.emit("nodeAdded",{key:e,attributes:t}),r}b(_r,"ge");w(_r,"addNode");function ot(n,e,t){const r=new n.NodeDataClass(e,t);return n._nodes.set(e,r),n.emit("nodeAdded",{key:e,attributes:t}),r}b(ot,"Z");w(ot,"unsafeAddNode");function ut(n,e,t,r,i,o,a,s){if(!r&&n.type==="undirected")throw new C(`Graph.${e}: you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead.`);if(r&&n.type==="directed")throw new C(`Graph.${e}: you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead.`);if(s&&!V(s))throw new E(`Graph.${e}: invalid attributes. Expecting an object but got "${s}"`);if(o=""+o,a=""+a,s=s||{},!n.allowSelfLoops&&o===a)throw new C(`Graph.${e}: source & target are the same ("${o}"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`);const d=n._nodes.get(o),c=n._nodes.get(a);if(!d)throw new v(`Graph.${e}: source node "${o}" not found.`);if(!c)throw new v(`Graph.${e}: target node "${a}" not found.`);const u={key:null,undirected:r,source:o,target:a,attributes:s};if(t)i=n._edgeKeyGenerator();else if(i=""+i,n._edges.has(i))throw new C(`Graph.${e}: the "${i}" edge already exists in the graph.`);if(!n.multi&&(r?typeof d.undirected[a]<"u":typeof d.out[a]<"u"))throw new C(`Graph.${e}: an edge linking "${o}" to "${a}" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option.`);const l=new be(r,i,d,c,s);n._edges.set(i,l);const g=o===a;return r?(d.undirectedDegree++,c.undirectedDegree++,g&&(d.undirectedLoops++,n._undirectedSelfLoopCount++)):(d.outDegree++,c.inDegree++,g&&(d.directedLoops++,n._directedSelfLoopCount++)),n.multi?l.attachMulti():l.attach(),r?n._undirectedSize++:n._directedSize++,u.key=i,n.emit("edgeAdded",u),i}b(ut,"ut");w(ut,"addEdge");function Dr(n,e,t,r,i,o,a,s,d){if(!r&&n.type==="undirected")throw new C(`Graph.${e}: you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead.`);if(r&&n.type==="directed")throw new C(`Graph.${e}: you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead.`);if(s){if(d){if(typeof s!="function")throw new E(`Graph.${e}: invalid updater function. Expecting a function but got "${s}"`)}else if(!V(s))throw new E(`Graph.${e}: invalid attributes. Expecting an object but got "${s}"`)}o=""+o,a=""+a;let c;if(d&&(c=s,s=void 0),!n.allowSelfLoops&&o===a)throw new C(`Graph.${e}: source & target are the same ("${o}"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`);let u=n._nodes.get(o),l=n._nodes.get(a),g,x;if(!t&&(g=n._edges.get(i),g)){if((g.source.key!==o||g.target.key!==a)&&(!r||g.source.key!==a||g.target.key!==o))throw new C(`Graph.${e}: inconsistency detected when attempting to merge the "${i}" edge with "${o}" source & "${a}" target vs. ("${g.source.key}", "${g.target.key}").`);x=g}if(!x&&!n.multi&&u&&(x=r?u.undirected[a]:u.out[a]),x){const R=[x.key,!1,!1,!1];if(d?!c:!s)return R;if(d){const U=x.attributes;x.attributes=c(U),n.emit("edgeAttributesUpdated",{type:"replace",key:x.key,attributes:x.attributes})}else H(x.attributes,s),n.emit("edgeAttributesUpdated",{type:"merge",key:x.key,attributes:x.attributes,data:s});return R}s=s||{},d&&c&&(s=c(s));const j={key:null,undirected:r,source:o,target:a,attributes:s};if(t)i=n._edgeKeyGenerator();else if(i=""+i,n._edges.has(i))throw new C(`Graph.${e}: the "${i}" edge already exists in the graph.`);let A=!1,G=!1;u||(u=ot(n,o,{}),A=!0,o===a&&(l=u,G=!0)),l||(l=ot(n,a,{}),G=!0),g=new be(r,i,u,l,s),n._edges.set(i,g);const D=o===a;return r?(u.undirectedDegree++,l.undirectedDegree++,D&&(u.undirectedLoops++,n._undirectedSelfLoopCount++)):(u.outDegree++,l.inDegree++,D&&(u.directedLoops++,n._directedSelfLoopCount++)),n.multi?g.attachMulti():g.attach(),r?n._undirectedSize++:n._directedSize++,j.key=i,n.emit("edgeAdded",j),[i,!0,A,G]}b(Dr,"ye");w(Dr,"mergeEdge");function fe(n,e){n._edges.delete(e.key);const{source:t,target:r,attributes:i}=e,o=e.undirected,a=t===r;o?(t.undirectedDegree--,r.undirectedDegree--,a&&(t.undirectedLoops--,n._undirectedSelfLoopCount--)):(t.outDegree--,r.inDegree--,a&&(t.directedLoops--,n._directedSelfLoopCount--)),n.multi?e.detachMulti():e.detach(),o?n._undirectedSize--:n._directedSize--,n.emit("edgeDropped",{key:e.key,attributes:i,source:t.key,target:r.key,undirected:o})}b(fe,"U$1");w(fe,"dropEdgeFromData");let P=class at extends si{static{b(this,"m")}static{w(this,"Graph")}constructor(e){if(super(),e=H({},yi,e),typeof e.multi!="boolean")throw new E(`Graph.constructor: invalid 'multi' option. Expecting a boolean but got "${e.multi}".`);if(!bi.has(e.type))throw new E(`Graph.constructor: invalid 'type' option. Should be one of "mixed", "directed" or "undirected" but got "${e.type}".`);if(typeof e.allowSelfLoops!="boolean")throw new E(`Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got "${e.allowSelfLoops}".`);const t=e.type==="mixed"?ct:e.type==="directed"?lt:ht;J(this,"NodeDataClass",t);const r="geid_"+mi()+"_";let i=0;const o=w(()=>{let a;do a=r+i++;while(this._edges.has(a));return a},"edgeKeyGenerator");J(this,"_attributes",{}),J(this,"_nodes",new Map),J(this,"_edges",new Map),J(this,"_directedSize",0),J(this,"_undirectedSize",0),J(this,"_directedSelfLoopCount",0),J(this,"_undirectedSelfLoopCount",0),J(this,"_edgeKeyGenerator",o),J(this,"_options",e),bt.forEach(a=>J(this,a,this[a])),re(this,"order",()=>this._nodes.size),re(this,"size",()=>this._edges.size),re(this,"directedSize",()=>this._directedSize),re(this,"undirectedSize",()=>this._undirectedSize),re(this,"selfLoopCount",()=>this._directedSelfLoopCount+this._undirectedSelfLoopCount),re(this,"directedSelfLoopCount",()=>this._directedSelfLoopCount),re(this,"undirectedSelfLoopCount",()=>this._undirectedSelfLoopCount),re(this,"multi",this._options.multi),re(this,"type",this._options.type),re(this,"allowSelfLoops",this._options.allowSelfLoops),re(this,"implementation",()=>"graphology")}_resetInstanceCounters(){this._directedSize=0,this._undirectedSize=0,this._directedSelfLoopCount=0,this._undirectedSelfLoopCount=0}hasNode(e){return this._nodes.has(""+e)}hasDirectedEdge(e,t){if(this.type==="undirected")return!1;if(arguments.length===1){const r=""+e,i=this._edges.get(r);return!!i&&!i.undirected}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?r.out.hasOwnProperty(t):!1}throw new E(`Graph.hasDirectedEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}hasUndirectedEdge(e,t){if(this.type==="directed")return!1;if(arguments.length===1){const r=""+e,i=this._edges.get(r);return!!i&&i.undirected}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?r.undirected.hasOwnProperty(t):!1}throw new E(`Graph.hasDirectedEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}hasEdge(e,t){if(arguments.length===1){const r=""+e;return this._edges.has(r)}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?typeof r.out<"u"&&r.out.hasOwnProperty(t)||typeof r.undirected<"u"&&r.undirected.hasOwnProperty(t):!1}throw new E(`Graph.hasEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}directedEdge(e,t){if(this.type==="undirected")return;if(e=""+e,t=""+t,this.multi)throw new C("Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.");const r=this._nodes.get(e);if(!r)throw new v(`Graph.directedEdge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.directedEdge: could not find the "${t}" target node in the graph.`);const i=r.out&&r.out[t]||void 0;if(i)return i.key}undirectedEdge(e,t){if(this.type==="directed")return;if(e=""+e,t=""+t,this.multi)throw new C("Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.");const r=this._nodes.get(e);if(!r)throw new v(`Graph.undirectedEdge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.undirectedEdge: could not find the "${t}" target node in the graph.`);const i=r.undirected&&r.undirected[t]||void 0;if(i)return i.key}edge(e,t){if(this.multi)throw new C("Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.");e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.edge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.edge: could not find the "${t}" target node in the graph.`);const i=r.out&&r.out[t]||r.undirected&&r.undirected[t]||void 0;if(i)return i.key}areDirectedNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areDirectedNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.in||t in r.out}areOutNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areOutNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.out}areInNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areInNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.in}areUndirectedNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areUndirectedNeighbors: could not find the "${e}" node in the graph.`);return this.type==="directed"?!1:t in r.undirected}areNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&(t in r.in||t in r.out)||this.type!=="directed"&&t in r.undirected}areInboundNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areInboundNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&t in r.in||this.type!=="directed"&&t in r.undirected}areOutboundNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areOutboundNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&t in r.out||this.type!=="directed"&&t in r.undirected}inDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree}outDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.outDegree}directedDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.directedDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree+t.outDegree}undirectedDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.undirectedDegree: could not find the "${e}" node in the graph.`);return this.type==="directed"?0:t.undirectedDegree}inboundDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inboundDegree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.inDegree),r}outboundDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outboundDegree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.outDegree),r}degree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.degree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.inDegree+t.outDegree),r}inDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree-t.directedLoops}outDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.outDegree-t.directedLoops}directedDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.directedDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree+t.outDegree-t.directedLoops*2}undirectedDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.undirectedDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="directed"?0:t.undirectedDegree-t.undirectedLoops*2}inboundDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inboundDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.inDegree,i+=t.directedLoops),r-i}outboundDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outboundDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.outDegree,i+=t.directedLoops),r-i}degreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.degreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.inDegree+t.outDegree,i+=t.directedLoops*2),r-i}source(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.source: could not find the "${e}" edge in the graph.`);return t.source.key}target(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.target: could not find the "${e}" edge in the graph.`);return t.target.key}extremities(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.extremities: could not find the "${e}" edge in the graph.`);return[t.source.key,t.target.key]}opposite(e,t){e=""+e,t=""+t;const r=this._edges.get(t);if(!r)throw new v(`Graph.opposite: could not find the "${t}" edge in the graph.`);const i=r.source.key,o=r.target.key;if(e===i)return o;if(e===o)return i;throw new v(`Graph.opposite: the "${e}" node is not attached to the "${t}" edge (${i}, ${o}).`)}hasExtremity(e,t){e=""+e,t=""+t;const r=this._edges.get(e);if(!r)throw new v(`Graph.hasExtremity: could not find the "${e}" edge in the graph.`);return r.source.key===t||r.target.key===t}isUndirected(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isUndirected: could not find the "${e}" edge in the graph.`);return t.undirected}isDirected(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isDirected: could not find the "${e}" edge in the graph.`);return!t.undirected}isSelfLoop(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isSelfLoop: could not find the "${e}" edge in the graph.`);return t.source===t.target}addNode(e,t){return _r(this,e,t).key}mergeNode(e,t){if(t&&!V(t))throw new E(`Graph.mergeNode: invalid attributes. Expecting an object but got "${t}"`);e=""+e,t=t||{};let r=this._nodes.get(e);return r?(t&&(H(r.attributes,t),this.emit("nodeAttributesUpdated",{type:"merge",key:e,attributes:r.attributes,data:t})),[e,!1]):(r=new this.NodeDataClass(e,t),this._nodes.set(e,r),this.emit("nodeAdded",{key:e,attributes:t}),[e,!0])}updateNode(e,t){if(t&&typeof t!="function")throw new E(`Graph.updateNode: invalid updater function. Expecting a function but got "${t}"`);e=""+e;let r=this._nodes.get(e);if(r){if(t){const o=r.attributes;r.attributes=t(o),this.emit("nodeAttributesUpdated",{type:"replace",key:e,attributes:r.attributes})}return[e,!1]}const i=t?t({}):{};return r=new this.NodeDataClass(e,i),this._nodes.set(e,r),this.emit("nodeAdded",{key:e,attributes:i}),[e,!0]}dropNode(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.dropNode: could not find the "${e}" node in the graph.`);let r;if(this.type!=="undirected"){for(const i in t.out){r=t.out[i];do fe(this,r),r=r.next;while(r)}for(const i in t.in){r=t.in[i];do fe(this,r),r=r.next;while(r)}}if(this.type!=="directed")for(const i in t.undirected){r=t.undirected[i];do fe(this,r),r=r.next;while(r)}this._nodes.delete(e),this.emit("nodeDropped",{key:e,attributes:t.attributes})}dropEdge(e){let t;if(arguments.length>1){const r=""+arguments[0],i=""+arguments[1];if(t=Z(this,r,i,this.type),!t)throw new v(`Graph.dropEdge: could not find the "${r}" -> "${i}" edge in the graph.`)}else if(e=""+e,t=this._edges.get(e),!t)throw new v(`Graph.dropEdge: could not find the "${e}" edge in the graph.`);return fe(this,t),this}dropDirectedEdge(e,t){if(arguments.length<2)throw new C("Graph.dropDirectedEdge: it does not make sense to try and drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.");if(this.multi)throw new C("Graph.dropDirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.");e=""+e,t=""+t;const r=Z(this,e,t,"directed");if(!r)throw new v(`Graph.dropDirectedEdge: could not find a "${e}" -> "${t}" edge in the graph.`);return fe(this,r),this}dropUndirectedEdge(e,t){if(arguments.length<2)throw new C("Graph.dropUndirectedEdge: it does not make sense to drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.");if(this.multi)throw new C("Graph.dropUndirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.");const r=Z(this,e,t,"undirected");if(!r)throw new v(`Graph.dropUndirectedEdge: could not find a "${e}" -> "${t}" edge in the graph.`);return fe(this,r),this}clear(){this._edges.clear(),this._nodes.clear(),this._resetInstanceCounters(),this.emit("cleared")}clearEdges(){const e=this._nodes.values();let t;for(;t=e.next(),t.done!==!0;)t.value.clear();this._edges.clear(),this._resetInstanceCounters(),this.emit("edgesCleared")}getAttribute(e){return this._attributes[e]}getAttributes(){return this._attributes}hasAttribute(e){return this._attributes.hasOwnProperty(e)}setAttribute(e,t){return this._attributes[e]=t,this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:e}),this}updateAttribute(e,t){if(typeof t!="function")throw new E("Graph.updateAttribute: updater should be a function.");const r=this._attributes[e];return this._attributes[e]=t(r),this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:e}),this}removeAttribute(e){return delete this._attributes[e],this.emit("attributesUpdated",{type:"remove",attributes:this._attributes,name:e}),this}replaceAttributes(e){if(!V(e))throw new E("Graph.replaceAttributes: provided attributes are not a plain object.");return this._attributes=e,this.emit("attributesUpdated",{type:"replace",attributes:this._attributes}),this}mergeAttributes(e){if(!V(e))throw new E("Graph.mergeAttributes: provided attributes are not a plain object.");return H(this._attributes,e),this.emit("attributesUpdated",{type:"merge",attributes:this._attributes,data:e}),this}updateAttributes(e){if(typeof e!="function")throw new E("Graph.updateAttributes: provided updater is not a function.");return this._attributes=e(this._attributes),this.emit("attributesUpdated",{type:"update",attributes:this._attributes}),this}updateEachNodeAttributes(e,t){if(typeof e!="function")throw new E("Graph.updateEachNodeAttributes: expecting an updater function.");if(t&&!nt(t))throw new E("Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");const r=this._nodes.values();let i,o;for(;i=r.next(),i.done!==!0;)o=i.value,o.attributes=e(o.key,o.attributes);this.emit("eachNodeAttributesUpdated",{hints:t||null})}updateEachEdgeAttributes(e,t){if(typeof e!="function")throw new E("Graph.updateEachEdgeAttributes: expecting an updater function.");if(t&&!nt(t))throw new E("Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");const r=this._edges.values();let i,o,a,s;for(;i=r.next(),i.done!==!0;)o=i.value,a=o.source,s=o.target,o.attributes=e(o.key,o.attributes,a.key,s.key,a.attributes,s.attributes,o.undirected);this.emit("eachEdgeAttributesUpdated",{hints:t||null})}forEachAdjacencyEntry(e){if(typeof e!="function")throw new E("Graph.forEachAdjacencyEntry: expecting a callback.");Me(!1,!1,!1,this,e)}forEachAdjacencyEntryWithOrphans(e){if(typeof e!="function")throw new E("Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.");Me(!1,!1,!0,this,e)}forEachAssymetricAdjacencyEntry(e){if(typeof e!="function")throw new E("Graph.forEachAssymetricAdjacencyEntry: expecting a callback.");Me(!1,!0,!1,this,e)}forEachAssymetricAdjacencyEntryWithOrphans(e){if(typeof e!="function")throw new E("Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.");Me(!1,!0,!0,this,e)}nodes(){return Array.from(this._nodes.keys())}forEachNode(e){if(typeof e!="function")throw new E("Graph.forEachNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)i=r.value,e(i.key,i.attributes)}findNode(e){if(typeof e!="function")throw new E("Graph.findNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,e(i.key,i.attributes))return i.key}mapNodes(e){if(typeof e!="function")throw new E("Graph.mapNode: expecting a callback.");const t=this._nodes.values();let r,i;const o=new Array(this.order);let a=0;for(;r=t.next(),r.done!==!0;)i=r.value,o[a++]=e(i.key,i.attributes);return o}someNode(e){if(typeof e!="function")throw new E("Graph.someNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,e(i.key,i.attributes))return!0;return!1}everyNode(e){if(typeof e!="function")throw new E("Graph.everyNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,!e(i.key,i.attributes))return!1;return!0}filterNodes(e){if(typeof e!="function")throw new E("Graph.filterNodes: expecting a callback.");const t=this._nodes.values();let r,i;const o=[];for(;r=t.next(),r.done!==!0;)i=r.value,e(i.key,i.attributes)&&o.push(i.key);return o}reduceNodes(e,t){if(typeof e!="function")throw new E("Graph.reduceNodes: expecting a callback.");if(arguments.length<2)throw new E("Graph.reduceNodes: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.");let r=t;const i=this._nodes.values();let o,a;for(;o=i.next(),o.done!==!0;)a=o.value,r=e(r,a.key,a.attributes);return r}nodeEntries(){const e=this._nodes.values();return{[Symbol.iterator](){return this},next(){const t=e.next();if(t.done)return t;const r=t.value;return{value:{node:r.key,attributes:r.attributes},done:!1}}}}export(){const e=new Array(this._nodes.size);let t=0;this._nodes.forEach((i,o)=>{e[t++]=Ar(o,i)});const r=new Array(this._edges.size);return t=0,this._edges.forEach((i,o)=>{r[t++]=Sr(this.type,o,i)}),{options:{type:this.type,multi:this.multi,allowSelfLoops:this.allowSelfLoops},attributes:this.getAttributes(),nodes:e,edges:r}}import(e,t=!1){if(e instanceof at)return e.forEachNode((d,c)=>{t?this.mergeNode(d,c):this.addNode(d,c)}),e.forEachEdge((d,c,u,l,g,x,j)=>{t?j?this.mergeUndirectedEdgeWithKey(d,u,l,c):this.mergeDirectedEdgeWithKey(d,u,l,c):j?this.addUndirectedEdgeWithKey(d,u,l,c):this.addDirectedEdgeWithKey(d,u,l,c)}),this;if(!V(e))throw new E("Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.");if(e.attributes){if(!V(e.attributes))throw new E("Graph.import: invalid attributes. Expecting a plain object.");t?this.mergeAttributes(e.attributes):this.replaceAttributes(e.attributes)}let r,i,o,a,s;if(e.nodes){if(o=e.nodes,!Array.isArray(o))throw new E("Graph.import: invalid nodes. Expecting an array.");for(r=0,i=o.length;r<i;r++){a=o[r],Nr(a);const{key:d,attributes:c}=a;t?this.mergeNode(d,c):this.addNode(d,c)}}if(e.edges){let d=!1;if(this.type==="undirected"&&(d=!0),o=e.edges,!Array.isArray(o))throw new E("Graph.import: invalid edges. Expecting an array.");for(r=0,i=o.length;r<i;r++){s=o[r],Cr(s);const{source:c,target:u,attributes:l,undirected:g=d}=s;let x;"key"in s?(x=t?g?this.mergeUndirectedEdgeWithKey:this.mergeDirectedEdgeWithKey:g?this.addUndirectedEdgeWithKey:this.addDirectedEdgeWithKey,x.call(this,s.key,c,u,l)):(x=t?g?this.mergeUndirectedEdge:this.mergeDirectedEdge:g?this.addUndirectedEdge:this.addDirectedEdge,x.call(this,c,u,l))}}return this}nullCopy(e){const t=new at(H({},this._options,e));return t.replaceAttributes(H({},this.getAttributes())),t}emptyCopy(e){const t=this.nullCopy(e);return this._nodes.forEach((r,i)=>{const o=H({},r.attributes);r=new t.NodeDataClass(i,o),t._nodes.set(i,r)}),t}copy(e){if(e=e||{},typeof e.type=="string"&&e.type!==this.type&&e.type!=="mixed")throw new C(`Graph.copy: cannot create an incompatible copy from "${this.type}" type to "${e.type}" because this would mean losing information about the current graph.`);if(typeof e.multi=="boolean"&&e.multi!==this.multi&&e.multi!==!0)throw new C("Graph.copy: cannot create an incompatible copy by downgrading a multi graph to a simple one because this would mean losing information about the current graph.");if(typeof e.allowSelfLoops=="boolean"&&e.allowSelfLoops!==this.allowSelfLoops&&e.allowSelfLoops!==!0)throw new C("Graph.copy: cannot create an incompatible copy from a graph allowing self loops to one that does not because this would mean losing information about the current graph.");const t=this.emptyCopy(e),r=this._edges.values();let i,o;for(;i=r.next(),i.done!==!0;)o=i.value,ut(t,"copy",!1,o.undirected,o.key,o.source.key,o.target.key,H({},o.attributes));return t}toJSON(){return this.export()}toString(){return"[object Graph]"}inspect(){const e={};this._nodes.forEach((o,a)=>{e[a]=o.attributes});const t={},r={};this._edges.forEach((o,a)=>{const s=o.undirected?"--":"->";let d="",c=o.source.key,u=o.target.key,l;o.undirected&&c>u&&(l=c,c=u,u=l);const g=`(${c})${s}(${u})`;a.startsWith("geid_")?this.multi&&(typeof r[g]>"u"?r[g]=0:r[g]++,d+=`${r[g]}. `):d+=`[${a}]: `,d+=g,t[d]=o.attributes});const i={};for(const o in this)this.hasOwnProperty(o)&&!bt.has(o)&&typeof this[o]!="function"&&typeof o!="symbol"&&(i[o]=this[o]);return i.attributes=this._attributes,i.nodes=e,i.edges=t,J(i,"constructor",this.constructor),i}};typeof Symbol<"u"&&(P.prototype[Symbol.for("nodejs.util.inspect.custom")]=P.prototype.inspect);wi.forEach(n=>{["add","merge","update"].forEach(e=>{const t=n.name(e),r=e==="add"?ut:Dr;n.generateKey?P.prototype[t]=function(i,o,a){return r(this,t,!0,(n.type||this.type)==="undirected",null,i,o,a,e==="update")}:P.prototype[t]=function(i,o,a,s){return r(this,t,!1,(n.type||this.type)==="undirected",i,o,a,s,e==="update")}})});Kt(P);nr(P);yr(P);jr(P);class Mr extends P{static{b(this,"Y")}static{w(this,"DirectedGraph")}constructor(e){const t=H({type:"directed"},e);if("multi"in t&&t.multi!==!1)throw new E("DirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if(t.type!=="directed")throw new E('DirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}let Ir=class extends P{static{b(this,"H")}static{w(this,"UndirectedGraph")}constructor(e){const t=H({type:"undirected"},e);if("multi"in t&&t.multi!==!1)throw new E("UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if(t.type!=="undirected")throw new E('UndirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}},Lr=class extends P{static{b(this,"J")}static{w(this,"MultiGraph")}constructor(e){const t=H({multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiGraph.from: inconsistent indication that the graph should be simple in given options!");super(t)}};class Tr extends P{static{b(this,"V")}static{w(this,"MultiDirectedGraph")}constructor(e){const t=H({type:"directed",multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if(t.type!=="directed")throw new E('MultiDirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}class Or extends P{static{b(this,"q")}static{w(this,"MultiUndirectedGraph")}constructor(e){const t=H({type:"undirected",multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if(t.type!=="undirected")throw new E('MultiUndirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}function we(n){n.from=function(e,t){const r=H({},e.options,t),i=new n(r);return i.import(e),i}}b(we,"C$1");w(we,"attachStaticFromMethod");we(P);we(Mr);we(Ir);we(Lr);we(Tr);we(Or);P.Graph=P;P.DirectedGraph=Mr;P.UndirectedGraph=Ir;P.MultiGraph=Lr;P.MultiDirectedGraph=Tr;P.MultiUndirectedGraph=Or;P.InvalidArgumentsGraphError=E;P.NotFoundGraphError=v;P.UsageGraphError=C;var et,wt;function xi(){if(wt)return et;wt=1;var n=Object.defineProperty,e=b((t,r)=>n(t,"name",{value:r,configurable:!0}),"e");return et=e(function(t){return t!==null&&typeof t=="object"&&typeof t.addUndirectedEdgeWithKey=="function"&&typeof t.dropNode=="function"&&typeof t.multi=="boolean"},"isGraph"),et}b(xi,"requireIsGraph");var De={},yt;function vi(){if(yt)return De;yt=1;var n=Object.defineProperty,e=b((o,a)=>n(o,"name",{value:a,configurable:!0}),"o");function t(o){return typeof o!="number"||isNaN(o)?1:o}b(t,"coerceWeight"),e(t,"coerceWeight");function r(o,a){var s={},d=e(function(l){return typeof l>"u"?a:l},"coerceToDefault");typeof a=="function"&&(d=a);var c=e(function(l){return d(l[o])},"get"),u=e(function(){return d(void 0)},"returnDefault");return typeof o=="string"?(s.fromAttributes=c,s.fromGraph=function(l,g){return c(l.getNodeAttributes(g))},s.fromEntry=function(l,g){return c(g)}):typeof o=="function"?(s.fromAttributes=function(){throw new Error("graphology-utils/getters/createNodeValueGetter: irrelevant usage.")},s.fromGraph=function(l,g){return d(o(g,l.getNodeAttributes(g)))},s.fromEntry=function(l,g){return d(o(l,g))}):(s.fromAttributes=u,s.fromGraph=u,s.fromEntry=u),s}b(r,"createNodeValueGetter"),e(r,"createNodeValueGetter");function i(o,a){var s={},d=e(function(l){return typeof l>"u"?a:l},"coerceToDefault");typeof a=="function"&&(d=a);var c=e(function(l){return d(l[o])},"get"),u=e(function(){return d(void 0)},"returnDefault");return typeof o=="string"?(s.fromAttributes=c,s.fromGraph=function(l,g){return c(l.getEdgeAttributes(g))},s.fromEntry=function(l,g){return c(g)},s.fromPartialEntry=s.fromEntry,s.fromMinimalEntry=s.fromEntry):typeof o=="function"?(s.fromAttributes=function(){throw new Error("graphology-utils/getters/createEdgeValueGetter: irrelevant usage.")},s.fromGraph=function(l,g){var x=l.extremities(g);return d(o(g,l.getEdgeAttributes(g),x[0],x[1],l.getNodeAttributes(x[0]),l.getNodeAttributes(x[1]),l.isUndirected(g)))},s.fromEntry=function(l,g,x,j,A,G,D){return d(o(l,g,x,j,A,G,D))},s.fromPartialEntry=function(l,g,x,j){return d(o(l,g,x,j))},s.fromMinimalEntry=function(l,g){return d(o(l,g))}):(s.fromAttributes=u,s.fromGraph=u,s.fromEntry=u,s.fromMinimalEntry=u),s}return b(i,"createEdgeValueGetter"),e(i,"createEdgeValueGetter"),De.createNodeValueGetter=r,De.createEdgeValueGetter=i,De.createEdgeWeightGetter=function(o){return i(o,t)},De}b(vi,"requireGetters");var tt,xt;function ki(){if(xt)return tt;xt=1;var n=Object.defineProperty,e=b((N,p)=>n(N,"name",{value:p,configurable:!0}),"$"),t=0,r=1,i=2,o=3,a=4,s=5,d=6,c=7,u=8,l=9,g=0,x=1,j=2,A=0,G=1,D=2,R=3,U=4,T=5,B=6,Y=7,Q=8,Se=3,X=10,Ye=3,I=9,L=10;return tt=e(function(N,p,ye){var Qe,k,f,F,q,he,xe,K,M,Je,ne=p.length,Rr=ye.length,Ne=N.adjustSizes,Ur=N.barnesHutTheta*N.barnesHutTheta,Le,W,O,z,se,_,S,m=[];for(f=0;f<ne;f+=X)p[f+a]=p[f+i],p[f+s]=p[f+o],p[f+i]=0,p[f+o]=0;if(N.outboundAttractionDistribution){for(Le=0,f=0;f<ne;f+=X)Le+=p[f+d];Le/=ne/X}if(N.barnesHutOptimize){var pe=1/0,ve=-1/0,ue=1/0,ke=-1/0,ee,Ee,Ze;for(f=0;f<ne;f+=X)pe=Math.min(pe,p[f+t]),ve=Math.max(ve,p[f+t]),ue=Math.min(ue,p[f+r]),ke=Math.max(ke,p[f+r]);var Te=ve-pe,Oe=ke-ue;for(Te>Oe?(ue-=(Te-Oe)/2,ke=ue+Te):(pe-=(Oe-Te)/2,ve=pe+Oe),m[0+A]=-1,m[0+G]=(pe+ve)/2,m[0+D]=(ue+ke)/2,m[0+R]=Math.max(ve-pe,ke-ue),m[0+U]=-1,m[0+T]=-1,m[0+B]=0,m[0+Y]=0,m[0+Q]=0,Qe=1,f=0;f<ne;f+=X)for(k=0,Ze=Se;;)if(m[k+T]>=0){p[f+t]<m[k+G]?p[f+r]<m[k+D]?ee=m[k+T]:ee=m[k+T]+I:p[f+r]<m[k+D]?ee=m[k+T]+I*2:ee=m[k+T]+I*3,m[k+Y]=(m[k+Y]*m[k+B]+p[f+t]*p[f+d])/(m[k+B]+p[f+d]),m[k+Q]=(m[k+Q]*m[k+B]+p[f+r]*p[f+d])/(m[k+B]+p[f+d]),m[k+B]+=p[f+d],k=ee;continue}else if(m[k+A]<0){m[k+A]=f;break}else{if(m[k+T]=Qe*I,K=m[k+R]/2,M=m[k+T],m[M+A]=-1,m[M+G]=m[k+G]-K,m[M+D]=m[k+D]-K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]-K,m[M+D]=m[k+D]+K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]+K,m[M+D]=m[k+D]-K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]+K,m[M+D]=m[k+D]+K,m[M+R]=K,m[M+U]=m[k+U],m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,Qe+=4,p[m[k+A]+t]<m[k+G]?p[m[k+A]+r]<m[k+D]?ee=m[k+T]:ee=m[k+T]+I:p[m[k+A]+r]<m[k+D]?ee=m[k+T]+I*2:ee=m[k+T]+I*3,m[k+B]=p[m[k+A]+d],m[k+Y]=p[m[k+A]+t],m[k+Q]=p[m[k+A]+r],m[ee+A]=m[k+A],m[k+A]=-1,p[f+t]<m[k+G]?p[f+r]<m[k+D]?Ee=m[k+T]:Ee=m[k+T]+I:p[f+r]<m[k+D]?Ee=m[k+T]+I*2:Ee=m[k+T]+I*3,ee===Ee)if(Ze--){k=ee;continue}else{Ze=Se;break}m[Ee+A]=f;break}}if(N.barnesHutOptimize)for(W=N.scalingRatio,f=0;f<ne;f+=X)for(k=0;;)if(m[k+T]>=0)if(_=Math.pow(p[f+t]-m[k+Y],2)+Math.pow(p[f+r]-m[k+Q],2),Je=m[k+R],4*Je*Je/_<Ur){if(O=p[f+t]-m[k+Y],z=p[f+r]-m[k+Q],Ne===!0?_>0?(S=W*p[f+d]*m[k+B]/_,p[f+i]+=O*S,p[f+o]+=z*S):_<0&&(S=-W*p[f+d]*m[k+B]/Math.sqrt(_),p[f+i]+=O*S,p[f+o]+=z*S):_>0&&(S=W*p[f+d]*m[k+B]/_,p[f+i]+=O*S,p[f+o]+=z*S),k=m[k+U],k<0)break;continue}else{k=m[k+T];continue}else{if(he=m[k+A],he>=0&&he!==f&&(O=p[f+t]-p[he+t],z=p[f+r]-p[he+r],_=O*O+z*z,Ne===!0?_>0?(S=W*p[f+d]*p[he+d]/_,p[f+i]+=O*S,p[f+o]+=z*S):_<0&&(S=-W*p[f+d]*p[he+d]/Math.sqrt(_),p[f+i]+=O*S,p[f+o]+=z*S):_>0&&(S=W*p[f+d]*p[he+d]/_,p[f+i]+=O*S,p[f+o]+=z*S)),k=m[k+U],k<0)break;continue}else for(W=N.scalingRatio,F=0;F<ne;F+=X)for(q=0;q<F;q+=X)O=p[F+t]-p[q+t],z=p[F+r]-p[q+r],Ne===!0?(_=Math.sqrt(O*O+z*z)-p[F+u]-p[q+u],_>0?(S=W*p[F+d]*p[q+d]/_/_,p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S):_<0&&(S=100*W*p[F+d]*p[q+d],p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S)):(_=Math.sqrt(O*O+z*z),_>0&&(S=W*p[F+d]*p[q+d]/_/_,p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S));for(M=N.gravity/N.scalingRatio,W=N.scalingRatio,f=0;f<ne;f+=X)S=0,O=p[f+t],z=p[f+r],_=Math.sqrt(Math.pow(O,2)+Math.pow(z,2)),N.strongGravityMode?_>0&&(S=W*p[f+d]*M):_>0&&(S=W*p[f+d]*M/_),p[f+i]-=O*S,p[f+o]-=z*S;for(W=1*(N.outboundAttractionDistribution?Le:1),xe=0;xe<Rr;xe+=Ye)F=ye[xe+g],q=ye[xe+x],K=ye[xe+j],se=Math.pow(K,N.edgeWeightInfluence),O=p[F+t]-p[q+t],z=p[F+r]-p[q+r],Ne===!0?(_=Math.sqrt(O*O+z*z)-p[F+u]-p[q+u],N.linLogMode?N.outboundAttractionDistribution?_>0&&(S=-W*se*Math.log(1+_)/_/p[F+d]):_>0&&(S=-W*se*Math.log(1+_)/_):N.outboundAttractionDistribution?_>0&&(S=-W*se/p[F+d]):_>0&&(S=-W*se)):(_=Math.sqrt(Math.pow(O,2)+Math.pow(z,2)),N.linLogMode?N.outboundAttractionDistribution?_>0&&(S=-W*se*Math.log(1+_)/_/p[F+d]):_>0&&(S=-W*se*Math.log(1+_)/_):N.outboundAttractionDistribution?(_=1,S=-W*se/p[F+d]):(_=1,S=-W*se)),_>0&&(p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S);var ze,Ce,Re,ge,Ue,Fe;if(Ne===!0)for(f=0;f<ne;f+=X)p[f+l]!==1&&(ze=Math.sqrt(Math.pow(p[f+i],2)+Math.pow(p[f+o],2)),ze>L&&(p[f+i]=p[f+i]*L/ze,p[f+o]=p[f+o]*L/ze),Ce=p[f+d]*Math.sqrt((p[f+a]-p[f+i])*(p[f+a]-p[f+i])+(p[f+s]-p[f+o])*(p[f+s]-p[f+o])),Re=Math.sqrt((p[f+a]+p[f+i])*(p[f+a]+p[f+i])+(p[f+s]+p[f+o])*(p[f+s]+p[f+o]))/2,ge=.1*Math.log(1+Re)/(1+Math.sqrt(Ce)),Ue=p[f+t]+p[f+i]*(ge/N.slowDown),p[f+t]=Ue,Fe=p[f+r]+p[f+o]*(ge/N.slowDown),p[f+r]=Fe);else for(f=0;f<ne;f+=X)p[f+l]!==1&&(Ce=p[f+d]*Math.sqrt((p[f+a]-p[f+i])*(p[f+a]-p[f+i])+(p[f+s]-p[f+o])*(p[f+s]-p[f+o])),Re=Math.sqrt((p[f+a]+p[f+i])*(p[f+a]+p[f+i])+(p[f+s]+p[f+o])*(p[f+s]+p[f+o]))/2,ge=p[f+c]*Math.log(1+Re)/(1+Math.sqrt(Ce)),p[f+c]=Math.min(1,Math.sqrt(ge*(Math.pow(p[f+i],2)+Math.pow(p[f+o],2))/(1+Math.sqrt(Ce)))),Ue=p[f+t]+p[f+i]*(ge/N.slowDown),p[f+t]=Ue,Fe=p[f+r]+p[f+o]*(ge/N.slowDown),p[f+r]=Fe);return{}},"iterate"),tt}b(ki,"requireIterate");var de={},vt;function Ei(){if(vt)return de;vt=1;var n=Object.defineProperty,e=b((i,o)=>n(i,"name",{value:o,configurable:!0}),"y"),t=10,r=3;return de.assign=function(i){i=i||{};var o=Array.prototype.slice.call(arguments).slice(1),a,s,d;for(a=0,d=o.length;a<d;a++)if(o[a])for(s in o[a])i[s]=o[a][s];return i},de.validateSettings=function(i){return"linLogMode"in i&&typeof i.linLogMode!="boolean"?{message:"the `linLogMode` setting should be a boolean."}:"outboundAttractionDistribution"in i&&typeof i.outboundAttractionDistribution!="boolean"?{message:"the `outboundAttractionDistribution` setting should be a boolean."}:"adjustSizes"in i&&typeof i.adjustSizes!="boolean"?{message:"the `adjustSizes` setting should be a boolean."}:"edgeWeightInfluence"in i&&typeof i.edgeWeightInfluence!="number"?{message:"the `edgeWeightInfluence` setting should be a number."}:"scalingRatio"in i&&!(typeof i.scalingRatio=="number"&&i.scalingRatio>=0)?{message:"the `scalingRatio` setting should be a number >= 0."}:"strongGravityMode"in i&&typeof i.strongGravityMode!="boolean"?{message:"the `strongGravityMode` setting should be a boolean."}:"gravity"in i&&!(typeof i.gravity=="number"&&i.gravity>=0)?{message:"the `gravity` setting should be a number >= 0."}:"slowDown"in i&&!(typeof i.slowDown=="number"||i.slowDown>=0)?{message:"the `slowDown` setting should be a number >= 0."}:"barnesHutOptimize"in i&&typeof i.barnesHutOptimize!="boolean"?{message:"the `barnesHutOptimize` setting should be a boolean."}:"barnesHutTheta"in i&&!(typeof i.barnesHutTheta=="number"&&i.barnesHutTheta>=0)?{message:"the `barnesHutTheta` setting should be a number >= 0."}:null},de.graphToByteArrays=function(i,o){var a=i.order,s=i.size,d={},c,u=new Float32Array(a*t),l=new Float32Array(s*r);return c=0,i.forEachNode(function(g,x){d[g]=c,u[c]=x.x,u[c+1]=x.y,u[c+2]=0,u[c+3]=0,u[c+4]=0,u[c+5]=0,u[c+6]=1,u[c+7]=1,u[c+8]=x.size||1,u[c+9]=x.fixed?1:0,c+=t}),c=0,i.forEachEdge(function(g,x,j,A,G,D,R){var U=d[j],T=d[A],B=o(g,x,j,A,G,D,R);u[U+6]+=B,u[T+6]+=B,l[c]=U,l[c+1]=T,l[c+2]=B,c+=r}),{nodes:u,edges:l}},de.assignLayoutChanges=function(i,o,a){var s=0;i.updateEachNodeAttributes(function(d,c){return c.x=o[s],c.y=o[s+1],s+=t,a?a(d,c):c})},de.readGraphPositions=function(i,o){var a=0;i.forEachNode(function(s,d){o[a]=d.x,o[a+1]=d.y,a+=t})},de.collectLayoutChanges=function(i,o,a){for(var s=i.nodes(),d={},c=0,u=0,l=o.length;c<l;c+=t){if(a){var g=Object.assign({},i.getNodeAttributes(s[u]));g.x=o[c],g.y=o[c+1],g=a(s[u],g),d[s[u]]={x:g.x,y:g.y}}else d[s[u]]={x:o[c],y:o[c+1]};u++}return d},de.createWorker=e(function(i){var o=window.URL||window.webkitURL,a=i.toString(),s=o.createObjectURL(new Blob(["("+a+").call(this);"],{type:"text/javascript"})),d=new Worker(s);return o.revokeObjectURL(s),d},"createWorker"),de}b(Ei,"requireHelpers");var rt,kt;function $i(){return kt||(kt=1,rt={linLogMode:!1,outboundAttractionDistribution:!1,adjustSizes:!1,edgeWeightInfluence:1,scalingRatio:1,strongGravityMode:!1,gravity:1,slowDown:1,barnesHutOptimize:!1,barnesHutTheta:.5}),rt}b($i,"requireDefaults");var it,Et;function Gi(){if(Et)return it;Et=1;var n=Object.defineProperty,e=b((u,l)=>n(u,"name",{value:l,configurable:!0}),"a"),t=xi(),r=vi().createEdgeWeightGetter,i=ki(),o=Ei(),a=$i();function s(u,l,g){if(!t(l))throw new Error("graphology-layout-forceatlas2: the given graph is not a valid graphology instance.");typeof g=="number"&&(g={iterations:g});var x=g.iterations;if(typeof x!="number")throw new Error("graphology-layout-forceatlas2: invalid number of iterations.");if(x<=0)throw new Error("graphology-layout-forceatlas2: you should provide a positive number of iterations.");var j=r("getEdgeWeight"in g?g.getEdgeWeight:"weight").fromEntry,A=typeof g.outputReducer=="function"?g.outputReducer:null,G=o.assign({},a,g.settings),D=o.validateSettings(G);if(D)throw new Error("graphology-layout-forceatlas2: "+D.message);var R=o.graphToByteArrays(l,j),U;for(U=0;U<x;U++)i(G,R.nodes,R.edges);if(u){o.assignLayoutChanges(l,R.nodes,A);return}return o.collectLayoutChanges(l,R.nodes)}b(s,"abstractSynchronousLayout"),e(s,"abstractSynchronousLayout");function d(u){var l=typeof u=="number"?u:u.order;return{barnesHutOptimize:l>2e3,strongGravityMode:!0,gravity:.05,scalingRatio:10,slowDown:1+Math.log(l)}}b(d,"inferSettings"),e(d,"inferSettings");var c=s.bind(null,!1);return c.assign=s.bind(null,!0),c.inferSettings=d,it=c,it}b(Gi,"requireGraphologyLayoutForceatlas2");var ji=Gi();const $t=di(ji);var Ai=`/*! tailwindcss v4.3.0 | MIT License | https://tailwindcss.com */
+var Fr=Object.defineProperty;var b=(n,e)=>Fr(n,"name",{value:e,configurable:!0});import{createRequire as Pr}from"node:module";import{E as ie,j as le,q as ft}from"../packem_shared/Table-DoSoazT6-DwnyTUsA.js";import{projectGraphToDot as Hr}from"@visulima/task-runner";import{a5 as h,a6 as $,n as y,aG as Vr,aH as Kr,aI as Xr,aF as Yr,w as te,af as Qr,aJ as Jr,aK as mt,C as Zr,S as ei,k as ti,R as ri,s as ii}from"./bin.js";import{g as di}from"../packem_shared/_commonjsHelpers-CLblCigl.js";import{d as ci}from"../packem_shared/anolilab-text-CAM_E6uK.js";const Wr=Pr(import.meta.url),_e=typeof globalThis<"u"&&typeof globalThis.process<"u"?globalThis.process:process,qe=b(n=>{if(typeof _e<"u"&&_e.versions&&_e.versions.node){const[e,t]=_e.versions.node.split(".").map(Number);if(e>22||e===22&&t>=3||e===20&&t>=16)return _e.getBuiltinModule(n)}return Wr(n)},"__cjs_getBuiltinModule"),{readFileSync:qr,writeFileSync:Br}=qe("node:fs"),{createRequire:ni}=qe("node:module"),{join:oi,dirname:ai}=qe("node:path"),{EventEmitter:si}=qe("events");var li=Object.defineProperty,w=b((n,e)=>li(n,"name",{value:e,configurable:!0}),"h");function _t(){const n=arguments[0];for(let e=1,t=arguments.length;e<t;e++)if(arguments[e])for(const r in arguments[e])n[r]=arguments[e][r];return n}b(_t,"ft");w(_t,"assignPolyfill");let H=_t;typeof Object.assign=="function"&&(H=Object.assign);function Z(n,e,t,r){const i=n._nodes.get(e);let o=null;return i&&(r==="mixed"?o=i.out&&i.out[t]||i.undirected&&i.undirected[t]:r==="directed"?o=i.out&&i.out[t]:o=i.undirected&&i.undirected[t]),o}b(Z,"D$1");w(Z,"getMatchingEdge");function V(n){return typeof n=="object"&&n!==null}b(V,"G$1");w(V,"isPlainObject");function st(n){let e;for(e in n)return!1;return!0}b(st,"tt");w(st,"isEmpty");function J(n,e,t){Object.defineProperty(n,e,{enumerable:!1,configurable:!1,writable:!0,value:t})}b(J,"x");w(J,"privateProperty");function re(n,e,t){const r={enumerable:!0,configurable:!0};typeof t=="function"?r.get=t:(r.value=t,r.writable=!1),Object.defineProperty(n,e,r)}b(re,"A$1");w(re,"readOnlyProperty");function nt(n){return!(!V(n)||n.attributes&&!Array.isArray(n.attributes))}b(nt,"Q");w(nt,"validateHints");function Dt(){let n=Math.floor(Math.random()*256)&255;return()=>n++}b(Dt,"pt");w(Dt,"incrementalIdStartingFromRandomByte");function oe(){const n=arguments;let e=null,t=-1;return{[Symbol.iterator](){return this},next(){let r=null;do{if(e===null){if(t++,t>=n.length)return{done:!0};e=n[t][Symbol.iterator]()}if(r=e.next(),r.done){e=null;continue}break}while(!0);return r}}}b(oe,"N$1");w(oe,"chain");function me(){return{[Symbol.iterator](){return this},next(){return{done:!0}}}}b(me,"L$2");w(me,"emptyIterator");let dt=class extends Error{static{b(this,"P")}static{w(this,"GraphError")}constructor(e){super(),this.name="GraphError",this.message=e}},E=class Mt extends dt{static{b(this,"g")}static{w(this,"InvalidArgumentsGraphError")}constructor(e){super(e),this.name="InvalidArgumentsGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,Mt.prototype.constructor)}},v=class It extends dt{static{b(this,"p")}static{w(this,"NotFoundGraphError")}constructor(e){super(e),this.name="NotFoundGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,It.prototype.constructor)}},C=class Lt extends dt{static{b(this,"y")}static{w(this,"UsageGraphError")}constructor(e){super(e),this.name="UsageGraphError",typeof Error.captureStackTrace=="function"&&Error.captureStackTrace(this,Lt.prototype.constructor)}};function ct(n,e){this.key=n,this.attributes=e,this.clear()}b(ct,"et");w(ct,"MixedNodeData");ct.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.undirectedDegree=0,this.undirectedLoops=0,this.directedLoops=0,this.in={},this.out={},this.undirected={}};function lt(n,e){this.key=n,this.attributes=e,this.clear()}b(lt,"it");w(lt,"DirectedNodeData");lt.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.directedLoops=0,this.in={},this.out={}};function ht(n,e){this.key=n,this.attributes=e,this.clear()}b(ht,"nt");w(ht,"UndirectedNodeData");ht.prototype.clear=function(){this.undirectedDegree=0,this.undirectedLoops=0,this.undirected={}};function be(n,e,t,r,i){this.key=e,this.attributes=i,this.undirected=n,this.source=t,this.target=r}b(be,"M$1");w(be,"EdgeData");be.prototype.attach=function(){let n="out",e="in";this.undirected&&(n=e="undirected");const t=this.source.key,r=this.target.key;this.source[n][r]=this,!(this.undirected&&t===r)&&(this.target[e][t]=this)};be.prototype.attachMulti=function(){let n="out",e="in";const t=this.source.key,r=this.target.key;this.undirected&&(n=e="undirected");const i=this.source[n],o=i[r];if(typeof o>"u"){i[r]=this,this.undirected&&t===r||(this.target[e][t]=this);return}o.previous=this,this.next=o,i[r]=this,this.target[e][t]=this};be.prototype.detach=function(){const n=this.source.key,e=this.target.key;let t="out",r="in";this.undirected&&(t=r="undirected"),delete this.source[t][e],delete this.target[r][n]};be.prototype.detachMulti=function(){const n=this.source.key,e=this.target.key;let t="out",r="in";this.undirected&&(t=r="undirected"),this.previous===void 0?this.next===void 0?(delete this.source[t][e],delete this.target[r][n]):(this.next.previous=void 0,this.source[t][e]=this.next,this.target[r][n]=this.next):(this.previous.next=this.next,this.next!==void 0&&(this.next.previous=this.previous))};const Tt=0,Ot=1,hi=2,zt=3;function ae(n,e,t,r,i,o,a){let s,d,c,u;if(r=""+r,t===Tt){if(s=n._nodes.get(r),!s)throw new v(`Graph.${e}: could not find the "${r}" node in the graph.`);c=i,u=o}else if(t===zt){if(i=""+i,d=n._edges.get(i),!d)throw new v(`Graph.${e}: could not find the "${i}" edge in the graph.`);const l=d.source.key,g=d.target.key;if(r===l)s=d.target;else if(r===g)s=d.source;else throw new v(`Graph.${e}: the "${r}" node is not attached to the "${i}" edge (${l}, ${g}).`);c=o,u=a}else{if(d=n._edges.get(r),!d)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`);t===Ot?s=d.source:s=d.target,c=i,u=o}return[s,c,u]}b(ae,"S$2");w(ae,"findRelevantNodeData");function Rt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return a.attributes[s]}}b(Rt,"gt");w(Rt,"attachNodeAttributeGetter");function Ut(n,e,t){n.prototype[e]=function(r,i){const[o]=ae(this,e,t,r,i);return o.attributes}}b(Ut,"yt");w(Ut,"attachNodeAttributesGetter");function Ft(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return a.attributes.hasOwnProperty(s)}}b(Ft,"wt");w(Ft,"attachNodeAttributeChecker");function Pt(n,e,t){n.prototype[e]=function(r,i,o,a){const[s,d,c]=ae(this,e,t,r,i,o,a);return s.attributes[d]=c,this.emit("nodeAttributesUpdated",{key:s.key,type:"set",attributes:s.attributes,name:d}),this}}b(Pt,"mt");w(Pt,"attachNodeAttributeSetter");function Wt(n,e,t){n.prototype[e]=function(r,i,o,a){const[s,d,c]=ae(this,e,t,r,i,o,a);if(typeof c!="function")throw new E(`Graph.${e}: updater should be a function.`);const u=s.attributes,l=c(u[d]);return u[d]=l,this.emit("nodeAttributesUpdated",{key:s.key,type:"set",attributes:s.attributes,name:d}),this}}b(Wt,"bt");w(Wt,"attachNodeAttributeUpdater");function qt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);return delete a.attributes[s],this.emit("nodeAttributesUpdated",{key:a.key,type:"remove",attributes:a.attributes,name:s}),this}}b(qt,"$t");w(qt,"attachNodeAttributeRemover");function Bt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(!V(s))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return a.attributes=s,this.emit("nodeAttributesUpdated",{key:a.key,type:"replace",attributes:a.attributes}),this}}b(Bt,"Gt");w(Bt,"attachNodeAttributesReplacer");function Ht(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(!V(s))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return H(a.attributes,s),this.emit("nodeAttributesUpdated",{key:a.key,type:"merge",attributes:a.attributes,data:s}),this}}b(Ht,"Et");w(Ht,"attachNodeAttributesMerger");function Vt(n,e,t){n.prototype[e]=function(r,i,o){const[a,s]=ae(this,e,t,r,i,o);if(typeof s!="function")throw new E(`Graph.${e}: provided updater is not a function.`);return a.attributes=s(a.attributes),this.emit("nodeAttributesUpdated",{key:a.key,type:"update",attributes:a.attributes}),this}}b(Vt,"kt");w(Vt,"attachNodeAttributesUpdater");const pi=[{name:w(n=>`get${n}Attribute`,"name"),attacher:Rt},{name:w(n=>`get${n}Attributes`,"name"),attacher:Ut},{name:w(n=>`has${n}Attribute`,"name"),attacher:Ft},{name:w(n=>`set${n}Attribute`,"name"),attacher:Pt},{name:w(n=>`update${n}Attribute`,"name"),attacher:Wt},{name:w(n=>`remove${n}Attribute`,"name"),attacher:qt},{name:w(n=>`replace${n}Attributes`,"name"),attacher:Bt},{name:w(n=>`merge${n}Attributes`,"name"),attacher:Ht},{name:w(n=>`update${n}Attributes`,"name"),attacher:Vt}];function Kt(n){pi.forEach(function({name:e,attacher:t}){t(n,e("Node"),Tt),t(n,e("Source"),Ot),t(n,e("Target"),hi),t(n,e("Opposite"),zt)})}b(Kt,"xt");w(Kt,"attachNodeAttributesMethods");function Xt(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return o.attributes[i]}}b(Xt,"Dt");w(Xt,"attachEdgeAttributeGetter");function Yt(n,e,t){n.prototype[e]=function(r){let i;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>1){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const o=""+r,a=""+arguments[1];if(i=Z(this,o,a,t),!i)throw new v(`Graph.${e}: could not find an edge for the given path ("${o}" - "${a}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,i=this._edges.get(r),!i)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return i.attributes}}b(Yt,"At");w(Yt,"attachEdgeAttributesGetter");function Qt(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return o.attributes.hasOwnProperty(i)}}b(Qt,"vt");w(Qt,"attachEdgeAttributeChecker");function Jt(n,e,t){n.prototype[e]=function(r,i,o){let a;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>3){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const s=""+r,d=""+i;if(i=arguments[2],o=arguments[3],a=Z(this,s,d,t),!a)throw new v(`Graph.${e}: could not find an edge for the given path ("${s}" - "${d}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,a=this._edges.get(r),!a)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return a.attributes[i]=o,this.emit("edgeAttributesUpdated",{key:a.key,type:"set",attributes:a.attributes,name:i}),this}}b(Jt,"Nt");w(Jt,"attachEdgeAttributeSetter");function Zt(n,e,t){n.prototype[e]=function(r,i,o){let a;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>3){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const s=""+r,d=""+i;if(i=arguments[2],o=arguments[3],a=Z(this,s,d,t),!a)throw new v(`Graph.${e}: could not find an edge for the given path ("${s}" - "${d}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,a=this._edges.get(r),!a)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(typeof o!="function")throw new E(`Graph.${e}: updater should be a function.`);return a.attributes[i]=o(a.attributes[i]),this.emit("edgeAttributesUpdated",{key:a.key,type:"set",attributes:a.attributes,name:i}),this}}b(Zt,"St");w(Zt,"attachEdgeAttributeUpdater");function er(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}return delete o.attributes[i],this.emit("edgeAttributesUpdated",{key:o.key,type:"remove",attributes:o.attributes,name:i}),this}}b(er,"Ut");w(er,"attachEdgeAttributeRemover");function tr(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(!V(i))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return o.attributes=i,this.emit("edgeAttributesUpdated",{key:o.key,type:"replace",attributes:o.attributes}),this}}b(tr,"Lt");w(tr,"attachEdgeAttributesReplacer");function rr(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(!V(i))throw new E(`Graph.${e}: provided attributes are not a plain object.`);return H(o.attributes,i),this.emit("edgeAttributesUpdated",{key:o.key,type:"merge",attributes:o.attributes,data:i}),this}}b(rr,"Mt");w(rr,"attachEdgeAttributesMerger");function ir(n,e,t){n.prototype[e]=function(r,i){let o;if(this.type!=="mixed"&&t!=="mixed"&&t!==this.type)throw new C(`Graph.${e}: cannot find this type of edges in your ${this.type} graph.`);if(arguments.length>2){if(this.multi)throw new C(`Graph.${e}: cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about.`);const a=""+r,s=""+i;if(i=arguments[2],o=Z(this,a,s,t),!o)throw new v(`Graph.${e}: could not find an edge for the given path ("${a}" - "${s}").`)}else{if(t!=="mixed")throw new C(`Graph.${e}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`);if(r=""+r,o=this._edges.get(r),!o)throw new v(`Graph.${e}: could not find the "${r}" edge in the graph.`)}if(typeof i!="function")throw new E(`Graph.${e}: provided updater is not a function.`);return o.attributes=i(o.attributes),this.emit("edgeAttributesUpdated",{key:o.key,type:"update",attributes:o.attributes}),this}}b(ir,"Ct");w(ir,"attachEdgeAttributesUpdater");const ui=[{name:w(n=>`get${n}Attribute`,"name"),attacher:Xt},{name:w(n=>`get${n}Attributes`,"name"),attacher:Yt},{name:w(n=>`has${n}Attribute`,"name"),attacher:Qt},{name:w(n=>`set${n}Attribute`,"name"),attacher:Jt},{name:w(n=>`update${n}Attribute`,"name"),attacher:Zt},{name:w(n=>`remove${n}Attribute`,"name"),attacher:er},{name:w(n=>`replace${n}Attributes`,"name"),attacher:tr},{name:w(n=>`merge${n}Attributes`,"name"),attacher:rr},{name:w(n=>`update${n}Attributes`,"name"),attacher:ir}];function nr(n){ui.forEach(function({name:e,attacher:t}){t(n,e("Edge"),"mixed"),t(n,e("DirectedEdge"),"directed"),t(n,e("UndirectedEdge"),"undirected")})}b(nr,"It");w(nr,"attachEdgeAttributesMethods");const gi=[{name:"edges",type:"mixed"},{name:"inEdges",type:"directed",direction:"in"},{name:"outEdges",type:"directed",direction:"out"},{name:"inboundEdges",type:"mixed",direction:"in"},{name:"outboundEdges",type:"mixed",direction:"out"},{name:"directedEdges",type:"directed"},{name:"undirectedEdges",type:"undirected"}];function or(n,e,t,r){let i=!1;for(const o in e){if(o===r)continue;const a=e[o];if(i=t(a.key,a.attributes,a.source.key,a.target.key,a.source.attributes,a.target.attributes,a.undirected),n&&i)return a.key}}b(or,"Ot");w(or,"forEachSimple");function ar(n,e,t,r){let i,o,a,s=!1;for(const d in e)if(d!==r){i=e[d];do{if(o=i.source,a=i.target,s=t(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected),n&&s)return i.key;i=i.next}while(i!==void 0)}}b(ar,"Wt");w(ar,"forEachMulti");function Pe(n,e){const t=Object.keys(n),r=t.length;let i,o=0;return{[Symbol.iterator](){return this},next(){do if(i)i=i.next;else{if(o>=r)return{done:!0};const a=t[o++];if(a===e){i=void 0;continue}i=n[a]}while(!i);return{done:!1,value:{edge:i.key,attributes:i.attributes,source:i.source.key,target:i.target.key,sourceAttributes:i.source.attributes,targetAttributes:i.target.attributes,undirected:i.undirected}}}}}b(Pe,"K");w(Pe,"createIterator");function sr(n,e,t,r){const i=e[t];if(!i)return;const o=i.source,a=i.target;if(r(i.key,i.attributes,o.key,a.key,o.attributes,a.attributes,i.undirected)&&n)return i.key}b(sr,"Kt");w(sr,"forEachForKeySimple");function dr(n,e,t,r){let i=e[t];if(!i)return;let o=!1;do{if(o=r(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected),n&&o)return i.key;i=i.next}while(i!==void 0)}b(dr,"Tt");w(dr,"forEachForKeyMulti");function We(n,e){let t=n[e];if(t.next!==void 0)return{[Symbol.iterator](){return this},next(){if(!t)return{done:!0};const i={edge:t.key,attributes:t.attributes,source:t.source.key,target:t.target.key,sourceAttributes:t.source.attributes,targetAttributes:t.target.attributes,undirected:t.undirected};return t=t.next,{done:!1,value:i}}};let r=!1;return{[Symbol.iterator](){return this},next(){return r===!0?{done:!0}:(r=!0,{done:!1,value:{edge:t.key,attributes:t.attributes,source:t.source.key,target:t.target.key,sourceAttributes:t.source.attributes,targetAttributes:t.target.attributes,undirected:t.undirected}})}}}b(We,"T$3");w(We,"createIteratorForKey");function cr(n,e){if(n.size===0)return[];if(e==="mixed"||e===n.type)return Array.from(n._edges.keys());const t=e==="undirected"?n.undirectedSize:n.directedSize,r=new Array(t),i=e==="undirected",o=n._edges.values();let a=0,s,d;for(;s=o.next(),s.done!==!0;)d=s.value,d.undirected===i&&(r[a++]=d.key);return r}b(cr,"Pt");w(cr,"createEdgeArray");function pt(n,e,t,r){if(e.size===0)return;const i=t!=="mixed"&&t!==e.type,o=t==="undirected";let a,s,d=!1;const c=e._edges.values();for(;a=c.next(),a.done!==!0;){if(s=a.value,i&&s.undirected!==o)continue;const{key:u,attributes:l,source:g,target:x}=s;if(d=r(u,l,g.key,x.key,g.attributes,x.attributes,s.undirected),n&&d)return u}}b(pt,"at");w(pt,"forEachEdge");function lr(n,e){if(n.size===0)return me();const t=e!=="mixed"&&e!==n.type,r=e==="undirected",i=n._edges.values();return{[Symbol.iterator](){return this},next(){let o,a;for(;;){if(o=i.next(),o.done)return o;if(a=o.value,!(t&&a.undirected!==r))break}return{value:{edge:a.key,attributes:a.attributes,source:a.source.key,target:a.target.key,sourceAttributes:a.source.attributes,targetAttributes:a.target.attributes,undirected:a.undirected},done:!1}}}}b(lr,"Ft");w(lr,"createEdgeIterator");function Be(n,e,t,r,i,o){const a=e?ar:or;let s;if(t!=="undirected"&&(r!=="out"&&(s=a(n,i.in,o),n&&s)||r!=="in"&&(s=a(n,i.out,o,r?void 0:i.key),n&&s))||t!=="directed"&&(s=a(n,i.undirected,o),n&&s))return s}b(Be,"F$1");w(Be,"forEachEdgeForNode");function hr(n,e,t,r){const i=[];return Be(!1,n,e,t,r,function(o){i.push(o)}),i}b(hr,"Bt");w(hr,"createEdgeArrayForNode");function pr(n,e,t){let r=me();return n!=="undirected"&&(e!=="out"&&typeof t.in<"u"&&(r=oe(r,Pe(t.in))),e!=="in"&&typeof t.out<"u"&&(r=oe(r,Pe(t.out,e?void 0:t.key)))),n!=="directed"&&typeof t.undirected<"u"&&(r=oe(r,Pe(t.undirected))),r}b(pr,"Rt");w(pr,"createEdgeIteratorForNode");function He(n,e,t,r,i,o,a){const s=t?dr:sr;let d;if(e!=="undirected"&&(typeof i.in<"u"&&r!=="out"&&(d=s(n,i.in,o,a),n&&d)||typeof i.out<"u"&&r!=="in"&&(r||i.key!==o)&&(d=s(n,i.out,o,a),n&&d))||e!=="directed"&&typeof i.undirected<"u"&&(d=s(n,i.undirected,o,a),n&&d))return d}b(He,"B");w(He,"forEachEdgeForPath");function ur(n,e,t,r,i){const o=[];return He(!1,n,e,t,r,i,function(a){o.push(a)}),o}b(ur,"Yt");w(ur,"createEdgeArrayForPath");function gr(n,e,t,r){let i=me();return n!=="undirected"&&(typeof t.in<"u"&&e!=="out"&&r in t.in&&(i=oe(i,We(t.in,r))),typeof t.out<"u"&&e!=="in"&&r in t.out&&(e||t.key!==r)&&(i=oe(i,We(t.out,r)))),n!=="directed"&&typeof t.undirected<"u"&&r in t.undirected&&(i=oe(i,We(t.undirected,r))),i}b(gr,"Ht");w(gr,"createEdgeIteratorForPath");function fr(n,e){const{name:t,type:r,direction:i}=e;n.prototype[t]=function(o,a){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return[];if(!arguments.length)return cr(this,r);if(arguments.length===1){o=""+o;const s=this._nodes.get(o);if(typeof s>"u")throw new v(`Graph.${t}: could not find the "${o}" node in the graph.`);return hr(this.multi,r==="mixed"?this.type:r,i,s)}if(arguments.length===2){o=""+o,a=""+a;const s=this._nodes.get(o);if(!s)throw new v(`Graph.${t}:  could not find the "${o}" source node in the graph.`);if(!this._nodes.has(a))throw new v(`Graph.${t}:  could not find the "${a}" target node in the graph.`);return ur(r,this.multi,i,s,a)}throw new E(`Graph.${t}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`)}}b(fr,"Jt");w(fr,"attachEdgeArrayCreator");function mr(n,e){const{name:t,type:r,direction:i}=e,o="forEach"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(c,u,l){if(!(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)){if(arguments.length===1)return l=c,pt(!1,this,r,l);if(arguments.length===2){c=""+c,l=u;const g=this._nodes.get(c);if(typeof g>"u")throw new v(`Graph.${o}: could not find the "${c}" node in the graph.`);return Be(!1,this.multi,r==="mixed"?this.type:r,i,g,l)}if(arguments.length===3){c=""+c,u=""+u;const g=this._nodes.get(c);if(!g)throw new v(`Graph.${o}:  could not find the "${c}" source node in the graph.`);if(!this._nodes.has(u))throw new v(`Graph.${o}:  could not find the "${u}" target node in the graph.`);return He(!1,r,this.multi,i,g,u,l)}throw new E(`Graph.${o}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`)}};const a="map"+t[0].toUpperCase()+t.slice(1);n.prototype[a]=function(){const c=Array.prototype.slice.call(arguments),u=c.pop();let l;if(c.length===0){let g=0;r!=="directed"&&(g+=this.undirectedSize),r!=="undirected"&&(g+=this.directedSize),l=new Array(g);let x=0;c.push((j,A,G,D,R,U,T)=>{l[x++]=u(j,A,G,D,R,U,T)})}else l=[],c.push((g,x,j,A,G,D,R)=>{l.push(u(g,x,j,A,G,D,R))});return this[o].apply(this,c),l};const s="filter"+t[0].toUpperCase()+t.slice(1);n.prototype[s]=function(){const c=Array.prototype.slice.call(arguments),u=c.pop(),l=[];return c.push((g,x,j,A,G,D,R)=>{u(g,x,j,A,G,D,R)&&l.push(g)}),this[o].apply(this,c),l};const d="reduce"+t[0].toUpperCase()+t.slice(1);n.prototype[d]=function(){let c=Array.prototype.slice.call(arguments);if(c.length<2||c.length>4)throw new E(`Graph.${d}: invalid number of arguments (expecting 2, 3 or 4 and got ${c.length}).`);if(typeof c[c.length-1]=="function"&&typeof c[c.length-2]!="function")throw new E(`Graph.${d}: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.`);let u,l;c.length===2?(u=c[0],l=c[1],c=[]):c.length===3?(u=c[1],l=c[2],c=[c[0]]):c.length===4&&(u=c[2],l=c[3],c=[c[0],c[1]]);let g=l;return c.push((x,j,A,G,D,R,U)=>{g=u(g,x,j,A,G,D,R,U)}),this[o].apply(this,c),g}}b(mr,"Vt");w(mr,"attachForEachEdge");function br(n,e){const{name:t,type:r,direction:i}=e,o="find"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(d,c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return!1;if(arguments.length===1)return u=d,pt(!0,this,r,u);if(arguments.length===2){d=""+d,u=c;const l=this._nodes.get(d);if(typeof l>"u")throw new v(`Graph.${o}: could not find the "${d}" node in the graph.`);return Be(!0,this.multi,r==="mixed"?this.type:r,i,l,u)}if(arguments.length===3){d=""+d,c=""+c;const l=this._nodes.get(d);if(!l)throw new v(`Graph.${o}:  could not find the "${d}" source node in the graph.`);if(!this._nodes.has(c))throw new v(`Graph.${o}:  could not find the "${c}" target node in the graph.`);return He(!0,r,this.multi,i,l,c,u)}throw new E(`Graph.${o}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`)};const a="some"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[a]=function(){const d=Array.prototype.slice.call(arguments),c=d.pop();return d.push((u,l,g,x,j,A,G)=>c(u,l,g,x,j,A,G)),!!this[o].apply(this,d)};const s="every"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[s]=function(){const d=Array.prototype.slice.call(arguments),c=d.pop();return d.push((u,l,g,x,j,A,G)=>!c(u,l,g,x,j,A,G)),!this[o].apply(this,d)}}b(br,"qt");w(br,"attachFindEdge");function wr(n,e){const{name:t,type:r,direction:i}=e,o=t.slice(0,-1)+"Entries";n.prototype[o]=function(a,s){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return me();if(!arguments.length)return lr(this,r);if(arguments.length===1){a=""+a;const d=this._nodes.get(a);if(!d)throw new v(`Graph.${o}: could not find the "${a}" node in the graph.`);return pr(r,i,d)}if(arguments.length===2){a=""+a,s=""+s;const d=this._nodes.get(a);if(!d)throw new v(`Graph.${o}:  could not find the "${a}" source node in the graph.`);if(!this._nodes.has(s))throw new v(`Graph.${o}:  could not find the "${s}" target node in the graph.`);return gr(r,i,d,s)}throw new E(`Graph.${o}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`)}}b(wr,"Qt");w(wr,"attachEdgeIteratorCreator");function yr(n){gi.forEach(e=>{fr(n,e),mr(n,e),br(n,e),wr(n,e)})}b(yr,"Xt");w(yr,"attachEdgeIterationMethods");const fi=[{name:"neighbors",type:"mixed"},{name:"inNeighbors",type:"directed",direction:"in"},{name:"outNeighbors",type:"directed",direction:"out"},{name:"inboundNeighbors",type:"mixed",direction:"in"},{name:"outboundNeighbors",type:"mixed",direction:"out"},{name:"directedNeighbors",type:"directed"},{name:"undirectedNeighbors",type:"undirected"}];function Ie(){this.A=null,this.B=null}b(Ie,"W");w(Ie,"CompositeSetWrapper");Ie.prototype.wrap=function(n){this.A===null?this.A=n:this.B===null&&(this.B=n)};Ie.prototype.has=function(n){return this.A!==null&&n in this.A||this.B!==null&&n in this.B};function $e(n,e,t,r,i){for(const o in r){const a=r[o],s=a.source,d=a.target,c=s===t?d:s;if(e&&e.has(c.key))continue;const u=i(c.key,c.attributes);if(n&&u)return c.key}}b($e,"I$1");w($e,"forEachInObjectOnce");function Ve(n,e,t,r,i){if(e!=="mixed"){if(e==="undirected")return $e(n,null,r,r.undirected,i);if(typeof t=="string")return $e(n,null,r,r[t],i)}const o=new Ie;let a;if(e!=="undirected"){if(t!=="out"){if(a=$e(n,null,r,r.in,i),n&&a)return a;o.wrap(r.in)}if(t!=="in"){if(a=$e(n,o,r,r.out,i),n&&a)return a;o.wrap(r.out)}}if(e!=="directed"&&(a=$e(n,o,r,r.undirected,i),n&&a))return a}b(Ve,"R$1");w(Ve,"forEachNeighbor");function xr(n,e,t){if(n!=="mixed"){if(n==="undirected")return Object.keys(t.undirected);if(typeof e=="string")return Object.keys(t[e])}const r=[];return Ve(!1,n,e,t,function(i){r.push(i)}),r}b(xr,"te$1");w(xr,"createNeighborArrayForNode");function Ge(n,e,t){const r=Object.keys(t),i=r.length;let o=0;return{[Symbol.iterator](){return this},next(){let a=null;do{if(o>=i)return n&&n.wrap(t),{done:!0};const s=t[r[o++]],d=s.source,c=s.target;if(a=d===e?c:d,n&&n.has(a.key)){a=null;continue}}while(a===null);return{done:!1,value:{neighbor:a.key,attributes:a.attributes}}}}}b(Ge,"j");w(Ge,"createDedupedObjectIterator");function vr(n,e,t){if(n!=="mixed"){if(n==="undirected")return Ge(null,t,t.undirected);if(typeof e=="string")return Ge(null,t,t[e])}let r=me();const i=new Ie;return n!=="undirected"&&(e!=="out"&&(r=oe(r,Ge(i,t,t.in))),e!=="in"&&(r=oe(r,Ge(i,t,t.out)))),n!=="directed"&&(r=oe(r,Ge(i,t,t.undirected))),r}b(vr,"ee$1");w(vr,"createNeighborIterator");function kr(n,e){const{name:t,type:r,direction:i}=e;n.prototype[t]=function(o){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return[];o=""+o;const a=this._nodes.get(o);if(typeof a>"u")throw new v(`Graph.${t}: could not find the "${o}" node in the graph.`);return xr(r==="mixed"?this.type:r,i,a)}}b(kr,"ie");w(kr,"attachNeighborArrayCreator");function Er(n,e){const{name:t,type:r,direction:i}=e,o="forEach"+t[0].toUpperCase()+t.slice(1,-1);n.prototype[o]=function(c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return;c=""+c;const l=this._nodes.get(c);if(typeof l>"u")throw new v(`Graph.${o}: could not find the "${c}" node in the graph.`);Ve(!1,r==="mixed"?this.type:r,i,l,u)};const a="map"+t[0].toUpperCase()+t.slice(1);n.prototype[a]=function(c,u){const l=[];return this[o](c,(g,x)=>{l.push(u(g,x))}),l};const s="filter"+t[0].toUpperCase()+t.slice(1);n.prototype[s]=function(c,u){const l=[];return this[o](c,(g,x)=>{u(g,x)&&l.push(g)}),l};const d="reduce"+t[0].toUpperCase()+t.slice(1);n.prototype[d]=function(c,u,l){if(arguments.length<3)throw new E(`Graph.${d}: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.`);let g=l;return this[o](c,(x,j)=>{g=u(g,x,j)}),g}}b(Er,"ne");w(Er,"attachForEachNeighbor");function $r(n,e){const{name:t,type:r,direction:i}=e,o=t[0].toUpperCase()+t.slice(1,-1),a="find"+o;n.prototype[a]=function(c,u){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return;c=""+c;const l=this._nodes.get(c);if(typeof l>"u")throw new v(`Graph.${a}: could not find the "${c}" node in the graph.`);return Ve(!0,r==="mixed"?this.type:r,i,l,u)};const s="some"+o;n.prototype[s]=function(c,u){return!!this[a](c,u)};const d="every"+o;n.prototype[d]=function(c,u){return!this[a](c,(l,g)=>!u(l,g))}}b($r,"re");w($r,"attachFindNeighbor");function Gr(n,e){const{name:t,type:r,direction:i}=e,o=t.slice(0,-1)+"Entries";n.prototype[o]=function(a){if(r!=="mixed"&&this.type!=="mixed"&&r!==this.type)return me();a=""+a;const s=this._nodes.get(a);if(typeof s>"u")throw new v(`Graph.${o}: could not find the "${a}" node in the graph.`);return vr(r==="mixed"?this.type:r,i,s)}}b(Gr,"oe");w(Gr,"attachNeighborIteratorCreator");function jr(n){fi.forEach(e=>{kr(n,e),Er(n,e),$r(n,e),Gr(n,e)})}b(jr,"se");w(jr,"attachNeighborIterationMethods");function Me(n,e,t,r,i){const o=r._nodes.values(),a=r.type;let s,d,c,u,l,g,x;for(;s=o.next(),s.done!==!0;){let j=!1;if(d=s.value,a!=="undirected"){u=d.out;for(c in u){l=u[c];do{if(g=l.target,j=!0,x=i(d.key,g.key,d.attributes,g.attributes,l.key,l.attributes,l.undirected),n&&x)return l;l=l.next}while(l)}}if(a!=="directed"){u=d.undirected;for(c in u)if(!(e&&d.key>c)){l=u[c];do{if(g=l.target,g.key!==c&&(g=l.source),j=!0,x=i(d.key,g.key,d.attributes,g.attributes,l.key,l.attributes,l.undirected),n&&x)return l;l=l.next}while(l)}}if(t&&!j&&(x=i(d.key,null,d.attributes,null,null,null,null),n&&x))return null}}b(Me,"O");w(Me,"forEachAdjacency");function Ar(n,e){const t={key:n};return st(e.attributes)||(t.attributes=H({},e.attributes)),t}b(Ar,"ae");w(Ar,"serializeNode");function Sr(n,e,t){const r={key:e,source:t.source.key,target:t.target.key};return st(t.attributes)||(r.attributes=H({},t.attributes)),n==="mixed"&&t.undirected&&(r.undirected=!0),r}b(Sr,"ue");w(Sr,"serializeEdge");function Nr(n){if(!V(n))throw new E('Graph.import: invalid serialized node. A serialized node should be a plain object with at least a "key" property.');if(!("key"in n))throw new E("Graph.import: serialized node is missing its key.");if("attributes"in n&&(!V(n.attributes)||n.attributes===null))throw new E("Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.")}b(Nr,"de");w(Nr,"validateSerializedNode");function Cr(n){if(!V(n))throw new E('Graph.import: invalid serialized edge. A serialized edge should be a plain object with at least a "source" & "target" property.');if(!("source"in n))throw new E("Graph.import: serialized edge is missing its source.");if(!("target"in n))throw new E("Graph.import: serialized edge is missing its target.");if("attributes"in n&&(!V(n.attributes)||n.attributes===null))throw new E("Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.");if("undirected"in n&&typeof n.undirected!="boolean")throw new E("Graph.import: invalid undirectedness information. Undirected should be boolean or omitted.")}b(Cr,"he");w(Cr,"validateSerializedEdge");const mi=Dt(),bi=new Set(["directed","undirected","mixed"]),bt=new Set(["domain","_events","_eventsCount","_maxListeners"]),wi=[{name:w(n=>`${n}Edge`,"name"),generateKey:!0},{name:w(n=>`${n}DirectedEdge`,"name"),generateKey:!0,type:"directed"},{name:w(n=>`${n}UndirectedEdge`,"name"),generateKey:!0,type:"undirected"},{name:w(n=>`${n}EdgeWithKey`,"name")},{name:w(n=>`${n}DirectedEdgeWithKey`,"name"),type:"directed"},{name:w(n=>`${n}UndirectedEdgeWithKey`,"name"),type:"undirected"}],yi={allowSelfLoops:!0,multi:!1,type:"mixed"};function _r(n,e,t){if(t&&!V(t))throw new E(`Graph.addNode: invalid attributes. Expecting an object but got "${t}"`);if(e=""+e,t=t||{},n._nodes.has(e))throw new C(`Graph.addNode: the "${e}" node already exist in the graph.`);const r=new n.NodeDataClass(e,t);return n._nodes.set(e,r),n.emit("nodeAdded",{key:e,attributes:t}),r}b(_r,"ge");w(_r,"addNode");function ot(n,e,t){const r=new n.NodeDataClass(e,t);return n._nodes.set(e,r),n.emit("nodeAdded",{key:e,attributes:t}),r}b(ot,"Z");w(ot,"unsafeAddNode");function ut(n,e,t,r,i,o,a,s){if(!r&&n.type==="undirected")throw new C(`Graph.${e}: you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead.`);if(r&&n.type==="directed")throw new C(`Graph.${e}: you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead.`);if(s&&!V(s))throw new E(`Graph.${e}: invalid attributes. Expecting an object but got "${s}"`);if(o=""+o,a=""+a,s=s||{},!n.allowSelfLoops&&o===a)throw new C(`Graph.${e}: source & target are the same ("${o}"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`);const d=n._nodes.get(o),c=n._nodes.get(a);if(!d)throw new v(`Graph.${e}: source node "${o}" not found.`);if(!c)throw new v(`Graph.${e}: target node "${a}" not found.`);const u={key:null,undirected:r,source:o,target:a,attributes:s};if(t)i=n._edgeKeyGenerator();else if(i=""+i,n._edges.has(i))throw new C(`Graph.${e}: the "${i}" edge already exists in the graph.`);if(!n.multi&&(r?typeof d.undirected[a]<"u":typeof d.out[a]<"u"))throw new C(`Graph.${e}: an edge linking "${o}" to "${a}" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option.`);const l=new be(r,i,d,c,s);n._edges.set(i,l);const g=o===a;return r?(d.undirectedDegree++,c.undirectedDegree++,g&&(d.undirectedLoops++,n._undirectedSelfLoopCount++)):(d.outDegree++,c.inDegree++,g&&(d.directedLoops++,n._directedSelfLoopCount++)),n.multi?l.attachMulti():l.attach(),r?n._undirectedSize++:n._directedSize++,u.key=i,n.emit("edgeAdded",u),i}b(ut,"ut");w(ut,"addEdge");function Dr(n,e,t,r,i,o,a,s,d){if(!r&&n.type==="undirected")throw new C(`Graph.${e}: you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead.`);if(r&&n.type==="directed")throw new C(`Graph.${e}: you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead.`);if(s){if(d){if(typeof s!="function")throw new E(`Graph.${e}: invalid updater function. Expecting a function but got "${s}"`)}else if(!V(s))throw new E(`Graph.${e}: invalid attributes. Expecting an object but got "${s}"`)}o=""+o,a=""+a;let c;if(d&&(c=s,s=void 0),!n.allowSelfLoops&&o===a)throw new C(`Graph.${e}: source & target are the same ("${o}"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`);let u=n._nodes.get(o),l=n._nodes.get(a),g,x;if(!t&&(g=n._edges.get(i),g)){if((g.source.key!==o||g.target.key!==a)&&(!r||g.source.key!==a||g.target.key!==o))throw new C(`Graph.${e}: inconsistency detected when attempting to merge the "${i}" edge with "${o}" source & "${a}" target vs. ("${g.source.key}", "${g.target.key}").`);x=g}if(!x&&!n.multi&&u&&(x=r?u.undirected[a]:u.out[a]),x){const R=[x.key,!1,!1,!1];if(d?!c:!s)return R;if(d){const U=x.attributes;x.attributes=c(U),n.emit("edgeAttributesUpdated",{type:"replace",key:x.key,attributes:x.attributes})}else H(x.attributes,s),n.emit("edgeAttributesUpdated",{type:"merge",key:x.key,attributes:x.attributes,data:s});return R}s=s||{},d&&c&&(s=c(s));const j={key:null,undirected:r,source:o,target:a,attributes:s};if(t)i=n._edgeKeyGenerator();else if(i=""+i,n._edges.has(i))throw new C(`Graph.${e}: the "${i}" edge already exists in the graph.`);let A=!1,G=!1;u||(u=ot(n,o,{}),A=!0,o===a&&(l=u,G=!0)),l||(l=ot(n,a,{}),G=!0),g=new be(r,i,u,l,s),n._edges.set(i,g);const D=o===a;return r?(u.undirectedDegree++,l.undirectedDegree++,D&&(u.undirectedLoops++,n._undirectedSelfLoopCount++)):(u.outDegree++,l.inDegree++,D&&(u.directedLoops++,n._directedSelfLoopCount++)),n.multi?g.attachMulti():g.attach(),r?n._undirectedSize++:n._directedSize++,j.key=i,n.emit("edgeAdded",j),[i,!0,A,G]}b(Dr,"ye");w(Dr,"mergeEdge");function fe(n,e){n._edges.delete(e.key);const{source:t,target:r,attributes:i}=e,o=e.undirected,a=t===r;o?(t.undirectedDegree--,r.undirectedDegree--,a&&(t.undirectedLoops--,n._undirectedSelfLoopCount--)):(t.outDegree--,r.inDegree--,a&&(t.directedLoops--,n._directedSelfLoopCount--)),n.multi?e.detachMulti():e.detach(),o?n._undirectedSize--:n._directedSize--,n.emit("edgeDropped",{key:e.key,attributes:i,source:t.key,target:r.key,undirected:o})}b(fe,"U$1");w(fe,"dropEdgeFromData");let P=class at extends si{static{b(this,"m")}static{w(this,"Graph")}constructor(e){if(super(),e=H({},yi,e),typeof e.multi!="boolean")throw new E(`Graph.constructor: invalid 'multi' option. Expecting a boolean but got "${e.multi}".`);if(!bi.has(e.type))throw new E(`Graph.constructor: invalid 'type' option. Should be one of "mixed", "directed" or "undirected" but got "${e.type}".`);if(typeof e.allowSelfLoops!="boolean")throw new E(`Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got "${e.allowSelfLoops}".`);const t=e.type==="mixed"?ct:e.type==="directed"?lt:ht;J(this,"NodeDataClass",t);const r="geid_"+mi()+"_";let i=0;const o=w(()=>{let a;do a=r+i++;while(this._edges.has(a));return a},"edgeKeyGenerator");J(this,"_attributes",{}),J(this,"_nodes",new Map),J(this,"_edges",new Map),J(this,"_directedSize",0),J(this,"_undirectedSize",0),J(this,"_directedSelfLoopCount",0),J(this,"_undirectedSelfLoopCount",0),J(this,"_edgeKeyGenerator",o),J(this,"_options",e),bt.forEach(a=>J(this,a,this[a])),re(this,"order",()=>this._nodes.size),re(this,"size",()=>this._edges.size),re(this,"directedSize",()=>this._directedSize),re(this,"undirectedSize",()=>this._undirectedSize),re(this,"selfLoopCount",()=>this._directedSelfLoopCount+this._undirectedSelfLoopCount),re(this,"directedSelfLoopCount",()=>this._directedSelfLoopCount),re(this,"undirectedSelfLoopCount",()=>this._undirectedSelfLoopCount),re(this,"multi",this._options.multi),re(this,"type",this._options.type),re(this,"allowSelfLoops",this._options.allowSelfLoops),re(this,"implementation",()=>"graphology")}_resetInstanceCounters(){this._directedSize=0,this._undirectedSize=0,this._directedSelfLoopCount=0,this._undirectedSelfLoopCount=0}hasNode(e){return this._nodes.has(""+e)}hasDirectedEdge(e,t){if(this.type==="undirected")return!1;if(arguments.length===1){const r=""+e,i=this._edges.get(r);return!!i&&!i.undirected}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?r.out.hasOwnProperty(t):!1}throw new E(`Graph.hasDirectedEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}hasUndirectedEdge(e,t){if(this.type==="directed")return!1;if(arguments.length===1){const r=""+e,i=this._edges.get(r);return!!i&&i.undirected}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?r.undirected.hasOwnProperty(t):!1}throw new E(`Graph.hasDirectedEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}hasEdge(e,t){if(arguments.length===1){const r=""+e;return this._edges.has(r)}else if(arguments.length===2){e=""+e,t=""+t;const r=this._nodes.get(e);return r?typeof r.out<"u"&&r.out.hasOwnProperty(t)||typeof r.undirected<"u"&&r.undirected.hasOwnProperty(t):!1}throw new E(`Graph.hasEdge: invalid arity (${arguments.length}, instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target.`)}directedEdge(e,t){if(this.type==="undirected")return;if(e=""+e,t=""+t,this.multi)throw new C("Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.");const r=this._nodes.get(e);if(!r)throw new v(`Graph.directedEdge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.directedEdge: could not find the "${t}" target node in the graph.`);const i=r.out&&r.out[t]||void 0;if(i)return i.key}undirectedEdge(e,t){if(this.type==="directed")return;if(e=""+e,t=""+t,this.multi)throw new C("Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.");const r=this._nodes.get(e);if(!r)throw new v(`Graph.undirectedEdge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.undirectedEdge: could not find the "${t}" target node in the graph.`);const i=r.undirected&&r.undirected[t]||void 0;if(i)return i.key}edge(e,t){if(this.multi)throw new C("Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.");e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.edge: could not find the "${e}" source node in the graph.`);if(!this._nodes.has(t))throw new v(`Graph.edge: could not find the "${t}" target node in the graph.`);const i=r.out&&r.out[t]||r.undirected&&r.undirected[t]||void 0;if(i)return i.key}areDirectedNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areDirectedNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.in||t in r.out}areOutNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areOutNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.out}areInNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areInNeighbors: could not find the "${e}" node in the graph.`);return this.type==="undirected"?!1:t in r.in}areUndirectedNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areUndirectedNeighbors: could not find the "${e}" node in the graph.`);return this.type==="directed"?!1:t in r.undirected}areNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&(t in r.in||t in r.out)||this.type!=="directed"&&t in r.undirected}areInboundNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areInboundNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&t in r.in||this.type!=="directed"&&t in r.undirected}areOutboundNeighbors(e,t){e=""+e,t=""+t;const r=this._nodes.get(e);if(!r)throw new v(`Graph.areOutboundNeighbors: could not find the "${e}" node in the graph.`);return this.type!=="undirected"&&t in r.out||this.type!=="directed"&&t in r.undirected}inDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree}outDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.outDegree}directedDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.directedDegree: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree+t.outDegree}undirectedDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.undirectedDegree: could not find the "${e}" node in the graph.`);return this.type==="directed"?0:t.undirectedDegree}inboundDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inboundDegree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.inDegree),r}outboundDegree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outboundDegree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.outDegree),r}degree(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.degree: could not find the "${e}" node in the graph.`);let r=0;return this.type!=="directed"&&(r+=t.undirectedDegree),this.type!=="undirected"&&(r+=t.inDegree+t.outDegree),r}inDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree-t.directedLoops}outDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.outDegree-t.directedLoops}directedDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.directedDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="undirected"?0:t.inDegree+t.outDegree-t.directedLoops*2}undirectedDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.undirectedDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);return this.type==="directed"?0:t.undirectedDegree-t.undirectedLoops*2}inboundDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.inboundDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.inDegree,i+=t.directedLoops),r-i}outboundDegreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.outboundDegreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.outDegree,i+=t.directedLoops),r-i}degreeWithoutSelfLoops(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.degreeWithoutSelfLoops: could not find the "${e}" node in the graph.`);let r=0,i=0;return this.type!=="directed"&&(r+=t.undirectedDegree,i+=t.undirectedLoops*2),this.type!=="undirected"&&(r+=t.inDegree+t.outDegree,i+=t.directedLoops*2),r-i}source(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.source: could not find the "${e}" edge in the graph.`);return t.source.key}target(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.target: could not find the "${e}" edge in the graph.`);return t.target.key}extremities(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.extremities: could not find the "${e}" edge in the graph.`);return[t.source.key,t.target.key]}opposite(e,t){e=""+e,t=""+t;const r=this._edges.get(t);if(!r)throw new v(`Graph.opposite: could not find the "${t}" edge in the graph.`);const i=r.source.key,o=r.target.key;if(e===i)return o;if(e===o)return i;throw new v(`Graph.opposite: the "${e}" node is not attached to the "${t}" edge (${i}, ${o}).`)}hasExtremity(e,t){e=""+e,t=""+t;const r=this._edges.get(e);if(!r)throw new v(`Graph.hasExtremity: could not find the "${e}" edge in the graph.`);return r.source.key===t||r.target.key===t}isUndirected(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isUndirected: could not find the "${e}" edge in the graph.`);return t.undirected}isDirected(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isDirected: could not find the "${e}" edge in the graph.`);return!t.undirected}isSelfLoop(e){e=""+e;const t=this._edges.get(e);if(!t)throw new v(`Graph.isSelfLoop: could not find the "${e}" edge in the graph.`);return t.source===t.target}addNode(e,t){return _r(this,e,t).key}mergeNode(e,t){if(t&&!V(t))throw new E(`Graph.mergeNode: invalid attributes. Expecting an object but got "${t}"`);e=""+e,t=t||{};let r=this._nodes.get(e);return r?(t&&(H(r.attributes,t),this.emit("nodeAttributesUpdated",{type:"merge",key:e,attributes:r.attributes,data:t})),[e,!1]):(r=new this.NodeDataClass(e,t),this._nodes.set(e,r),this.emit("nodeAdded",{key:e,attributes:t}),[e,!0])}updateNode(e,t){if(t&&typeof t!="function")throw new E(`Graph.updateNode: invalid updater function. Expecting a function but got "${t}"`);e=""+e;let r=this._nodes.get(e);if(r){if(t){const o=r.attributes;r.attributes=t(o),this.emit("nodeAttributesUpdated",{type:"replace",key:e,attributes:r.attributes})}return[e,!1]}const i=t?t({}):{};return r=new this.NodeDataClass(e,i),this._nodes.set(e,r),this.emit("nodeAdded",{key:e,attributes:i}),[e,!0]}dropNode(e){e=""+e;const t=this._nodes.get(e);if(!t)throw new v(`Graph.dropNode: could not find the "${e}" node in the graph.`);let r;if(this.type!=="undirected"){for(const i in t.out){r=t.out[i];do fe(this,r),r=r.next;while(r)}for(const i in t.in){r=t.in[i];do fe(this,r),r=r.next;while(r)}}if(this.type!=="directed")for(const i in t.undirected){r=t.undirected[i];do fe(this,r),r=r.next;while(r)}this._nodes.delete(e),this.emit("nodeDropped",{key:e,attributes:t.attributes})}dropEdge(e){let t;if(arguments.length>1){const r=""+arguments[0],i=""+arguments[1];if(t=Z(this,r,i,this.type),!t)throw new v(`Graph.dropEdge: could not find the "${r}" -> "${i}" edge in the graph.`)}else if(e=""+e,t=this._edges.get(e),!t)throw new v(`Graph.dropEdge: could not find the "${e}" edge in the graph.`);return fe(this,t),this}dropDirectedEdge(e,t){if(arguments.length<2)throw new C("Graph.dropDirectedEdge: it does not make sense to try and drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.");if(this.multi)throw new C("Graph.dropDirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.");e=""+e,t=""+t;const r=Z(this,e,t,"directed");if(!r)throw new v(`Graph.dropDirectedEdge: could not find a "${e}" -> "${t}" edge in the graph.`);return fe(this,r),this}dropUndirectedEdge(e,t){if(arguments.length<2)throw new C("Graph.dropUndirectedEdge: it does not make sense to drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.");if(this.multi)throw new C("Graph.dropUndirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.");const r=Z(this,e,t,"undirected");if(!r)throw new v(`Graph.dropUndirectedEdge: could not find a "${e}" -> "${t}" edge in the graph.`);return fe(this,r),this}clear(){this._edges.clear(),this._nodes.clear(),this._resetInstanceCounters(),this.emit("cleared")}clearEdges(){const e=this._nodes.values();let t;for(;t=e.next(),t.done!==!0;)t.value.clear();this._edges.clear(),this._resetInstanceCounters(),this.emit("edgesCleared")}getAttribute(e){return this._attributes[e]}getAttributes(){return this._attributes}hasAttribute(e){return this._attributes.hasOwnProperty(e)}setAttribute(e,t){return this._attributes[e]=t,this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:e}),this}updateAttribute(e,t){if(typeof t!="function")throw new E("Graph.updateAttribute: updater should be a function.");const r=this._attributes[e];return this._attributes[e]=t(r),this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:e}),this}removeAttribute(e){return delete this._attributes[e],this.emit("attributesUpdated",{type:"remove",attributes:this._attributes,name:e}),this}replaceAttributes(e){if(!V(e))throw new E("Graph.replaceAttributes: provided attributes are not a plain object.");return this._attributes=e,this.emit("attributesUpdated",{type:"replace",attributes:this._attributes}),this}mergeAttributes(e){if(!V(e))throw new E("Graph.mergeAttributes: provided attributes are not a plain object.");return H(this._attributes,e),this.emit("attributesUpdated",{type:"merge",attributes:this._attributes,data:e}),this}updateAttributes(e){if(typeof e!="function")throw new E("Graph.updateAttributes: provided updater is not a function.");return this._attributes=e(this._attributes),this.emit("attributesUpdated",{type:"update",attributes:this._attributes}),this}updateEachNodeAttributes(e,t){if(typeof e!="function")throw new E("Graph.updateEachNodeAttributes: expecting an updater function.");if(t&&!nt(t))throw new E("Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");const r=this._nodes.values();let i,o;for(;i=r.next(),i.done!==!0;)o=i.value,o.attributes=e(o.key,o.attributes);this.emit("eachNodeAttributesUpdated",{hints:t||null})}updateEachEdgeAttributes(e,t){if(typeof e!="function")throw new E("Graph.updateEachEdgeAttributes: expecting an updater function.");if(t&&!nt(t))throw new E("Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");const r=this._edges.values();let i,o,a,s;for(;i=r.next(),i.done!==!0;)o=i.value,a=o.source,s=o.target,o.attributes=e(o.key,o.attributes,a.key,s.key,a.attributes,s.attributes,o.undirected);this.emit("eachEdgeAttributesUpdated",{hints:t||null})}forEachAdjacencyEntry(e){if(typeof e!="function")throw new E("Graph.forEachAdjacencyEntry: expecting a callback.");Me(!1,!1,!1,this,e)}forEachAdjacencyEntryWithOrphans(e){if(typeof e!="function")throw new E("Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.");Me(!1,!1,!0,this,e)}forEachAssymetricAdjacencyEntry(e){if(typeof e!="function")throw new E("Graph.forEachAssymetricAdjacencyEntry: expecting a callback.");Me(!1,!0,!1,this,e)}forEachAssymetricAdjacencyEntryWithOrphans(e){if(typeof e!="function")throw new E("Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.");Me(!1,!0,!0,this,e)}nodes(){return Array.from(this._nodes.keys())}forEachNode(e){if(typeof e!="function")throw new E("Graph.forEachNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)i=r.value,e(i.key,i.attributes)}findNode(e){if(typeof e!="function")throw new E("Graph.findNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,e(i.key,i.attributes))return i.key}mapNodes(e){if(typeof e!="function")throw new E("Graph.mapNode: expecting a callback.");const t=this._nodes.values();let r,i;const o=new Array(this.order);let a=0;for(;r=t.next(),r.done!==!0;)i=r.value,o[a++]=e(i.key,i.attributes);return o}someNode(e){if(typeof e!="function")throw new E("Graph.someNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,e(i.key,i.attributes))return!0;return!1}everyNode(e){if(typeof e!="function")throw new E("Graph.everyNode: expecting a callback.");const t=this._nodes.values();let r,i;for(;r=t.next(),r.done!==!0;)if(i=r.value,!e(i.key,i.attributes))return!1;return!0}filterNodes(e){if(typeof e!="function")throw new E("Graph.filterNodes: expecting a callback.");const t=this._nodes.values();let r,i;const o=[];for(;r=t.next(),r.done!==!0;)i=r.value,e(i.key,i.attributes)&&o.push(i.key);return o}reduceNodes(e,t){if(typeof e!="function")throw new E("Graph.reduceNodes: expecting a callback.");if(arguments.length<2)throw new E("Graph.reduceNodes: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.");let r=t;const i=this._nodes.values();let o,a;for(;o=i.next(),o.done!==!0;)a=o.value,r=e(r,a.key,a.attributes);return r}nodeEntries(){const e=this._nodes.values();return{[Symbol.iterator](){return this},next(){const t=e.next();if(t.done)return t;const r=t.value;return{value:{node:r.key,attributes:r.attributes},done:!1}}}}export(){const e=new Array(this._nodes.size);let t=0;this._nodes.forEach((i,o)=>{e[t++]=Ar(o,i)});const r=new Array(this._edges.size);return t=0,this._edges.forEach((i,o)=>{r[t++]=Sr(this.type,o,i)}),{options:{type:this.type,multi:this.multi,allowSelfLoops:this.allowSelfLoops},attributes:this.getAttributes(),nodes:e,edges:r}}import(e,t=!1){if(e instanceof at)return e.forEachNode((d,c)=>{t?this.mergeNode(d,c):this.addNode(d,c)}),e.forEachEdge((d,c,u,l,g,x,j)=>{t?j?this.mergeUndirectedEdgeWithKey(d,u,l,c):this.mergeDirectedEdgeWithKey(d,u,l,c):j?this.addUndirectedEdgeWithKey(d,u,l,c):this.addDirectedEdgeWithKey(d,u,l,c)}),this;if(!V(e))throw new E("Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.");if(e.attributes){if(!V(e.attributes))throw new E("Graph.import: invalid attributes. Expecting a plain object.");t?this.mergeAttributes(e.attributes):this.replaceAttributes(e.attributes)}let r,i,o,a,s;if(e.nodes){if(o=e.nodes,!Array.isArray(o))throw new E("Graph.import: invalid nodes. Expecting an array.");for(r=0,i=o.length;r<i;r++){a=o[r],Nr(a);const{key:d,attributes:c}=a;t?this.mergeNode(d,c):this.addNode(d,c)}}if(e.edges){let d=!1;if(this.type==="undirected"&&(d=!0),o=e.edges,!Array.isArray(o))throw new E("Graph.import: invalid edges. Expecting an array.");for(r=0,i=o.length;r<i;r++){s=o[r],Cr(s);const{source:c,target:u,attributes:l,undirected:g=d}=s;let x;"key"in s?(x=t?g?this.mergeUndirectedEdgeWithKey:this.mergeDirectedEdgeWithKey:g?this.addUndirectedEdgeWithKey:this.addDirectedEdgeWithKey,x.call(this,s.key,c,u,l)):(x=t?g?this.mergeUndirectedEdge:this.mergeDirectedEdge:g?this.addUndirectedEdge:this.addDirectedEdge,x.call(this,c,u,l))}}return this}nullCopy(e){const t=new at(H({},this._options,e));return t.replaceAttributes(H({},this.getAttributes())),t}emptyCopy(e){const t=this.nullCopy(e);return this._nodes.forEach((r,i)=>{const o=H({},r.attributes);r=new t.NodeDataClass(i,o),t._nodes.set(i,r)}),t}copy(e){if(e=e||{},typeof e.type=="string"&&e.type!==this.type&&e.type!=="mixed")throw new C(`Graph.copy: cannot create an incompatible copy from "${this.type}" type to "${e.type}" because this would mean losing information about the current graph.`);if(typeof e.multi=="boolean"&&e.multi!==this.multi&&e.multi!==!0)throw new C("Graph.copy: cannot create an incompatible copy by downgrading a multi graph to a simple one because this would mean losing information about the current graph.");if(typeof e.allowSelfLoops=="boolean"&&e.allowSelfLoops!==this.allowSelfLoops&&e.allowSelfLoops!==!0)throw new C("Graph.copy: cannot create an incompatible copy from a graph allowing self loops to one that does not because this would mean losing information about the current graph.");const t=this.emptyCopy(e),r=this._edges.values();let i,o;for(;i=r.next(),i.done!==!0;)o=i.value,ut(t,"copy",!1,o.undirected,o.key,o.source.key,o.target.key,H({},o.attributes));return t}toJSON(){return this.export()}toString(){return"[object Graph]"}inspect(){const e={};this._nodes.forEach((o,a)=>{e[a]=o.attributes});const t={},r={};this._edges.forEach((o,a)=>{const s=o.undirected?"--":"->";let d="",c=o.source.key,u=o.target.key,l;o.undirected&&c>u&&(l=c,c=u,u=l);const g=`(${c})${s}(${u})`;a.startsWith("geid_")?this.multi&&(typeof r[g]>"u"?r[g]=0:r[g]++,d+=`${r[g]}. `):d+=`[${a}]: `,d+=g,t[d]=o.attributes});const i={};for(const o in this)this.hasOwnProperty(o)&&!bt.has(o)&&typeof this[o]!="function"&&typeof o!="symbol"&&(i[o]=this[o]);return i.attributes=this._attributes,i.nodes=e,i.edges=t,J(i,"constructor",this.constructor),i}};typeof Symbol<"u"&&(P.prototype[Symbol.for("nodejs.util.inspect.custom")]=P.prototype.inspect);wi.forEach(n=>{["add","merge","update"].forEach(e=>{const t=n.name(e),r=e==="add"?ut:Dr;n.generateKey?P.prototype[t]=function(i,o,a){return r(this,t,!0,(n.type||this.type)==="undirected",null,i,o,a,e==="update")}:P.prototype[t]=function(i,o,a,s){return r(this,t,!1,(n.type||this.type)==="undirected",i,o,a,s,e==="update")}})});Kt(P);nr(P);yr(P);jr(P);class Mr extends P{static{b(this,"Y")}static{w(this,"DirectedGraph")}constructor(e){const t=H({type:"directed"},e);if("multi"in t&&t.multi!==!1)throw new E("DirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if(t.type!=="directed")throw new E('DirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}let Ir=class extends P{static{b(this,"H")}static{w(this,"UndirectedGraph")}constructor(e){const t=H({type:"undirected"},e);if("multi"in t&&t.multi!==!1)throw new E("UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if(t.type!=="undirected")throw new E('UndirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}},Lr=class extends P{static{b(this,"J")}static{w(this,"MultiGraph")}constructor(e){const t=H({multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiGraph.from: inconsistent indication that the graph should be simple in given options!");super(t)}};class Tr extends P{static{b(this,"V")}static{w(this,"MultiDirectedGraph")}constructor(e){const t=H({type:"directed",multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if(t.type!=="directed")throw new E('MultiDirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}class Or extends P{static{b(this,"q")}static{w(this,"MultiUndirectedGraph")}constructor(e){const t=H({type:"undirected",multi:!0},e);if("multi"in t&&t.multi!==!0)throw new E("MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if(t.type!=="undirected")throw new E('MultiUndirectedGraph.from: inconsistent "'+t.type+'" type in given options!');super(t)}}function we(n){n.from=function(e,t){const r=H({},e.options,t),i=new n(r);return i.import(e),i}}b(we,"C$1");w(we,"attachStaticFromMethod");we(P);we(Mr);we(Ir);we(Lr);we(Tr);we(Or);P.Graph=P;P.DirectedGraph=Mr;P.UndirectedGraph=Ir;P.MultiGraph=Lr;P.MultiDirectedGraph=Tr;P.MultiUndirectedGraph=Or;P.InvalidArgumentsGraphError=E;P.NotFoundGraphError=v;P.UsageGraphError=C;var et,wt;function xi(){if(wt)return et;wt=1;var n=Object.defineProperty,e=b((t,r)=>n(t,"name",{value:r,configurable:!0}),"e");return et=e(function(t){return t!==null&&typeof t=="object"&&typeof t.addUndirectedEdgeWithKey=="function"&&typeof t.dropNode=="function"&&typeof t.multi=="boolean"},"isGraph"),et}b(xi,"requireIsGraph");var De={},yt;function vi(){if(yt)return De;yt=1;var n=Object.defineProperty,e=b((o,a)=>n(o,"name",{value:a,configurable:!0}),"o");function t(o){return typeof o!="number"||isNaN(o)?1:o}b(t,"coerceWeight"),e(t,"coerceWeight");function r(o,a){var s={},d=e(function(l){return typeof l>"u"?a:l},"coerceToDefault");typeof a=="function"&&(d=a);var c=e(function(l){return d(l[o])},"get"),u=e(function(){return d(void 0)},"returnDefault");return typeof o=="string"?(s.fromAttributes=c,s.fromGraph=function(l,g){return c(l.getNodeAttributes(g))},s.fromEntry=function(l,g){return c(g)}):typeof o=="function"?(s.fromAttributes=function(){throw new Error("graphology-utils/getters/createNodeValueGetter: irrelevant usage.")},s.fromGraph=function(l,g){return d(o(g,l.getNodeAttributes(g)))},s.fromEntry=function(l,g){return d(o(l,g))}):(s.fromAttributes=u,s.fromGraph=u,s.fromEntry=u),s}b(r,"createNodeValueGetter"),e(r,"createNodeValueGetter");function i(o,a){var s={},d=e(function(l){return typeof l>"u"?a:l},"coerceToDefault");typeof a=="function"&&(d=a);var c=e(function(l){return d(l[o])},"get"),u=e(function(){return d(void 0)},"returnDefault");return typeof o=="string"?(s.fromAttributes=c,s.fromGraph=function(l,g){return c(l.getEdgeAttributes(g))},s.fromEntry=function(l,g){return c(g)},s.fromPartialEntry=s.fromEntry,s.fromMinimalEntry=s.fromEntry):typeof o=="function"?(s.fromAttributes=function(){throw new Error("graphology-utils/getters/createEdgeValueGetter: irrelevant usage.")},s.fromGraph=function(l,g){var x=l.extremities(g);return d(o(g,l.getEdgeAttributes(g),x[0],x[1],l.getNodeAttributes(x[0]),l.getNodeAttributes(x[1]),l.isUndirected(g)))},s.fromEntry=function(l,g,x,j,A,G,D){return d(o(l,g,x,j,A,G,D))},s.fromPartialEntry=function(l,g,x,j){return d(o(l,g,x,j))},s.fromMinimalEntry=function(l,g){return d(o(l,g))}):(s.fromAttributes=u,s.fromGraph=u,s.fromEntry=u,s.fromMinimalEntry=u),s}return b(i,"createEdgeValueGetter"),e(i,"createEdgeValueGetter"),De.createNodeValueGetter=r,De.createEdgeValueGetter=i,De.createEdgeWeightGetter=function(o){return i(o,t)},De}b(vi,"requireGetters");var tt,xt;function ki(){if(xt)return tt;xt=1;var n=Object.defineProperty,e=b((N,p)=>n(N,"name",{value:p,configurable:!0}),"$"),t=0,r=1,i=2,o=3,a=4,s=5,d=6,c=7,u=8,l=9,g=0,x=1,j=2,A=0,G=1,D=2,R=3,U=4,T=5,B=6,Y=7,Q=8,Se=3,X=10,Ye=3,I=9,L=10;return tt=e(function(N,p,ye){var Qe,k,f,F,q,he,xe,K,M,Je,ne=p.length,Rr=ye.length,Ne=N.adjustSizes,Ur=N.barnesHutTheta*N.barnesHutTheta,Le,W,O,z,se,_,S,m=[];for(f=0;f<ne;f+=X)p[f+a]=p[f+i],p[f+s]=p[f+o],p[f+i]=0,p[f+o]=0;if(N.outboundAttractionDistribution){for(Le=0,f=0;f<ne;f+=X)Le+=p[f+d];Le/=ne/X}if(N.barnesHutOptimize){var pe=1/0,ve=-1/0,ue=1/0,ke=-1/0,ee,Ee,Ze;for(f=0;f<ne;f+=X)pe=Math.min(pe,p[f+t]),ve=Math.max(ve,p[f+t]),ue=Math.min(ue,p[f+r]),ke=Math.max(ke,p[f+r]);var Te=ve-pe,Oe=ke-ue;for(Te>Oe?(ue-=(Te-Oe)/2,ke=ue+Te):(pe-=(Oe-Te)/2,ve=pe+Oe),m[0+A]=-1,m[0+G]=(pe+ve)/2,m[0+D]=(ue+ke)/2,m[0+R]=Math.max(ve-pe,ke-ue),m[0+U]=-1,m[0+T]=-1,m[0+B]=0,m[0+Y]=0,m[0+Q]=0,Qe=1,f=0;f<ne;f+=X)for(k=0,Ze=Se;;)if(m[k+T]>=0){p[f+t]<m[k+G]?p[f+r]<m[k+D]?ee=m[k+T]:ee=m[k+T]+I:p[f+r]<m[k+D]?ee=m[k+T]+I*2:ee=m[k+T]+I*3,m[k+Y]=(m[k+Y]*m[k+B]+p[f+t]*p[f+d])/(m[k+B]+p[f+d]),m[k+Q]=(m[k+Q]*m[k+B]+p[f+r]*p[f+d])/(m[k+B]+p[f+d]),m[k+B]+=p[f+d],k=ee;continue}else if(m[k+A]<0){m[k+A]=f;break}else{if(m[k+T]=Qe*I,K=m[k+R]/2,M=m[k+T],m[M+A]=-1,m[M+G]=m[k+G]-K,m[M+D]=m[k+D]-K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]-K,m[M+D]=m[k+D]+K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]+K,m[M+D]=m[k+D]-K,m[M+R]=K,m[M+U]=M+I,m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,M+=I,m[M+A]=-1,m[M+G]=m[k+G]+K,m[M+D]=m[k+D]+K,m[M+R]=K,m[M+U]=m[k+U],m[M+T]=-1,m[M+B]=0,m[M+Y]=0,m[M+Q]=0,Qe+=4,p[m[k+A]+t]<m[k+G]?p[m[k+A]+r]<m[k+D]?ee=m[k+T]:ee=m[k+T]+I:p[m[k+A]+r]<m[k+D]?ee=m[k+T]+I*2:ee=m[k+T]+I*3,m[k+B]=p[m[k+A]+d],m[k+Y]=p[m[k+A]+t],m[k+Q]=p[m[k+A]+r],m[ee+A]=m[k+A],m[k+A]=-1,p[f+t]<m[k+G]?p[f+r]<m[k+D]?Ee=m[k+T]:Ee=m[k+T]+I:p[f+r]<m[k+D]?Ee=m[k+T]+I*2:Ee=m[k+T]+I*3,ee===Ee)if(Ze--){k=ee;continue}else{Ze=Se;break}m[Ee+A]=f;break}}if(N.barnesHutOptimize)for(W=N.scalingRatio,f=0;f<ne;f+=X)for(k=0;;)if(m[k+T]>=0)if(_=Math.pow(p[f+t]-m[k+Y],2)+Math.pow(p[f+r]-m[k+Q],2),Je=m[k+R],4*Je*Je/_<Ur){if(O=p[f+t]-m[k+Y],z=p[f+r]-m[k+Q],Ne===!0?_>0?(S=W*p[f+d]*m[k+B]/_,p[f+i]+=O*S,p[f+o]+=z*S):_<0&&(S=-W*p[f+d]*m[k+B]/Math.sqrt(_),p[f+i]+=O*S,p[f+o]+=z*S):_>0&&(S=W*p[f+d]*m[k+B]/_,p[f+i]+=O*S,p[f+o]+=z*S),k=m[k+U],k<0)break;continue}else{k=m[k+T];continue}else{if(he=m[k+A],he>=0&&he!==f&&(O=p[f+t]-p[he+t],z=p[f+r]-p[he+r],_=O*O+z*z,Ne===!0?_>0?(S=W*p[f+d]*p[he+d]/_,p[f+i]+=O*S,p[f+o]+=z*S):_<0&&(S=-W*p[f+d]*p[he+d]/Math.sqrt(_),p[f+i]+=O*S,p[f+o]+=z*S):_>0&&(S=W*p[f+d]*p[he+d]/_,p[f+i]+=O*S,p[f+o]+=z*S)),k=m[k+U],k<0)break;continue}else for(W=N.scalingRatio,F=0;F<ne;F+=X)for(q=0;q<F;q+=X)O=p[F+t]-p[q+t],z=p[F+r]-p[q+r],Ne===!0?(_=Math.sqrt(O*O+z*z)-p[F+u]-p[q+u],_>0?(S=W*p[F+d]*p[q+d]/_/_,p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S):_<0&&(S=100*W*p[F+d]*p[q+d],p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S)):(_=Math.sqrt(O*O+z*z),_>0&&(S=W*p[F+d]*p[q+d]/_/_,p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S));for(M=N.gravity/N.scalingRatio,W=N.scalingRatio,f=0;f<ne;f+=X)S=0,O=p[f+t],z=p[f+r],_=Math.sqrt(Math.pow(O,2)+Math.pow(z,2)),N.strongGravityMode?_>0&&(S=W*p[f+d]*M):_>0&&(S=W*p[f+d]*M/_),p[f+i]-=O*S,p[f+o]-=z*S;for(W=1*(N.outboundAttractionDistribution?Le:1),xe=0;xe<Rr;xe+=Ye)F=ye[xe+g],q=ye[xe+x],K=ye[xe+j],se=Math.pow(K,N.edgeWeightInfluence),O=p[F+t]-p[q+t],z=p[F+r]-p[q+r],Ne===!0?(_=Math.sqrt(O*O+z*z)-p[F+u]-p[q+u],N.linLogMode?N.outboundAttractionDistribution?_>0&&(S=-W*se*Math.log(1+_)/_/p[F+d]):_>0&&(S=-W*se*Math.log(1+_)/_):N.outboundAttractionDistribution?_>0&&(S=-W*se/p[F+d]):_>0&&(S=-W*se)):(_=Math.sqrt(Math.pow(O,2)+Math.pow(z,2)),N.linLogMode?N.outboundAttractionDistribution?_>0&&(S=-W*se*Math.log(1+_)/_/p[F+d]):_>0&&(S=-W*se*Math.log(1+_)/_):N.outboundAttractionDistribution?(_=1,S=-W*se/p[F+d]):(_=1,S=-W*se)),_>0&&(p[F+i]+=O*S,p[F+o]+=z*S,p[q+i]-=O*S,p[q+o]-=z*S);var ze,Ce,Re,ge,Ue,Fe;if(Ne===!0)for(f=0;f<ne;f+=X)p[f+l]!==1&&(ze=Math.sqrt(Math.pow(p[f+i],2)+Math.pow(p[f+o],2)),ze>L&&(p[f+i]=p[f+i]*L/ze,p[f+o]=p[f+o]*L/ze),Ce=p[f+d]*Math.sqrt((p[f+a]-p[f+i])*(p[f+a]-p[f+i])+(p[f+s]-p[f+o])*(p[f+s]-p[f+o])),Re=Math.sqrt((p[f+a]+p[f+i])*(p[f+a]+p[f+i])+(p[f+s]+p[f+o])*(p[f+s]+p[f+o]))/2,ge=.1*Math.log(1+Re)/(1+Math.sqrt(Ce)),Ue=p[f+t]+p[f+i]*(ge/N.slowDown),p[f+t]=Ue,Fe=p[f+r]+p[f+o]*(ge/N.slowDown),p[f+r]=Fe);else for(f=0;f<ne;f+=X)p[f+l]!==1&&(Ce=p[f+d]*Math.sqrt((p[f+a]-p[f+i])*(p[f+a]-p[f+i])+(p[f+s]-p[f+o])*(p[f+s]-p[f+o])),Re=Math.sqrt((p[f+a]+p[f+i])*(p[f+a]+p[f+i])+(p[f+s]+p[f+o])*(p[f+s]+p[f+o]))/2,ge=p[f+c]*Math.log(1+Re)/(1+Math.sqrt(Ce)),p[f+c]=Math.min(1,Math.sqrt(ge*(Math.pow(p[f+i],2)+Math.pow(p[f+o],2))/(1+Math.sqrt(Ce)))),Ue=p[f+t]+p[f+i]*(ge/N.slowDown),p[f+t]=Ue,Fe=p[f+r]+p[f+o]*(ge/N.slowDown),p[f+r]=Fe);return{}},"iterate"),tt}b(ki,"requireIterate");var de={},vt;function Ei(){if(vt)return de;vt=1;var n=Object.defineProperty,e=b((i,o)=>n(i,"name",{value:o,configurable:!0}),"y"),t=10,r=3;return de.assign=function(i){i=i||{};var o=Array.prototype.slice.call(arguments).slice(1),a,s,d;for(a=0,d=o.length;a<d;a++)if(o[a])for(s in o[a])i[s]=o[a][s];return i},de.validateSettings=function(i){return"linLogMode"in i&&typeof i.linLogMode!="boolean"?{message:"the `linLogMode` setting should be a boolean."}:"outboundAttractionDistribution"in i&&typeof i.outboundAttractionDistribution!="boolean"?{message:"the `outboundAttractionDistribution` setting should be a boolean."}:"adjustSizes"in i&&typeof i.adjustSizes!="boolean"?{message:"the `adjustSizes` setting should be a boolean."}:"edgeWeightInfluence"in i&&typeof i.edgeWeightInfluence!="number"?{message:"the `edgeWeightInfluence` setting should be a number."}:"scalingRatio"in i&&!(typeof i.scalingRatio=="number"&&i.scalingRatio>=0)?{message:"the `scalingRatio` setting should be a number >= 0."}:"strongGravityMode"in i&&typeof i.strongGravityMode!="boolean"?{message:"the `strongGravityMode` setting should be a boolean."}:"gravity"in i&&!(typeof i.gravity=="number"&&i.gravity>=0)?{message:"the `gravity` setting should be a number >= 0."}:"slowDown"in i&&!(typeof i.slowDown=="number"||i.slowDown>=0)?{message:"the `slowDown` setting should be a number >= 0."}:"barnesHutOptimize"in i&&typeof i.barnesHutOptimize!="boolean"?{message:"the `barnesHutOptimize` setting should be a boolean."}:"barnesHutTheta"in i&&!(typeof i.barnesHutTheta=="number"&&i.barnesHutTheta>=0)?{message:"the `barnesHutTheta` setting should be a number >= 0."}:null},de.graphToByteArrays=function(i,o){var a=i.order,s=i.size,d={},c,u=new Float32Array(a*t),l=new Float32Array(s*r);return c=0,i.forEachNode(function(g,x){d[g]=c,u[c]=x.x,u[c+1]=x.y,u[c+2]=0,u[c+3]=0,u[c+4]=0,u[c+5]=0,u[c+6]=1,u[c+7]=1,u[c+8]=x.size||1,u[c+9]=x.fixed?1:0,c+=t}),c=0,i.forEachEdge(function(g,x,j,A,G,D,R){var U=d[j],T=d[A],B=o(g,x,j,A,G,D,R);u[U+6]+=B,u[T+6]+=B,l[c]=U,l[c+1]=T,l[c+2]=B,c+=r}),{nodes:u,edges:l}},de.assignLayoutChanges=function(i,o,a){var s=0;i.updateEachNodeAttributes(function(d,c){return c.x=o[s],c.y=o[s+1],s+=t,a?a(d,c):c})},de.readGraphPositions=function(i,o){var a=0;i.forEachNode(function(s,d){o[a]=d.x,o[a+1]=d.y,a+=t})},de.collectLayoutChanges=function(i,o,a){for(var s=i.nodes(),d={},c=0,u=0,l=o.length;c<l;c+=t){if(a){var g=Object.assign({},i.getNodeAttributes(s[u]));g.x=o[c],g.y=o[c+1],g=a(s[u],g),d[s[u]]={x:g.x,y:g.y}}else d[s[u]]={x:o[c],y:o[c+1]};u++}return d},de.createWorker=e(function(i){var o=window.URL||window.webkitURL,a=i.toString(),s=o.createObjectURL(new Blob(["("+a+").call(this);"],{type:"text/javascript"})),d=new Worker(s);return o.revokeObjectURL(s),d},"createWorker"),de}b(Ei,"requireHelpers");var rt,kt;function $i(){return kt||(kt=1,rt={linLogMode:!1,outboundAttractionDistribution:!1,adjustSizes:!1,edgeWeightInfluence:1,scalingRatio:1,strongGravityMode:!1,gravity:1,slowDown:1,barnesHutOptimize:!1,barnesHutTheta:.5}),rt}b($i,"requireDefaults");var it,Et;function Gi(){if(Et)return it;Et=1;var n=Object.defineProperty,e=b((u,l)=>n(u,"name",{value:l,configurable:!0}),"a"),t=xi(),r=vi().createEdgeWeightGetter,i=ki(),o=Ei(),a=$i();function s(u,l,g){if(!t(l))throw new Error("graphology-layout-forceatlas2: the given graph is not a valid graphology instance.");typeof g=="number"&&(g={iterations:g});var x=g.iterations;if(typeof x!="number")throw new Error("graphology-layout-forceatlas2: invalid number of iterations.");if(x<=0)throw new Error("graphology-layout-forceatlas2: you should provide a positive number of iterations.");var j=r("getEdgeWeight"in g?g.getEdgeWeight:"weight").fromEntry,A=typeof g.outputReducer=="function"?g.outputReducer:null,G=o.assign({},a,g.settings),D=o.validateSettings(G);if(D)throw new Error("graphology-layout-forceatlas2: "+D.message);var R=o.graphToByteArrays(l,j),U;for(U=0;U<x;U++)i(G,R.nodes,R.edges);if(u){o.assignLayoutChanges(l,R.nodes,A);return}return o.collectLayoutChanges(l,R.nodes)}b(s,"abstractSynchronousLayout"),e(s,"abstractSynchronousLayout");function d(u){var l=typeof u=="number"?u:u.order;return{barnesHutOptimize:l>2e3,strongGravityMode:!0,gravity:.05,scalingRatio:10,slowDown:1+Math.log(l)}}b(d,"inferSettings"),e(d,"inferSettings");var c=s.bind(null,!1);return c.assign=s.bind(null,!0),c.inferSettings=d,it=c,it}b(Gi,"requireGraphologyLayoutForceatlas2");var ji=Gi();const $t=di(ji);var Ai=`/*! tailwindcss v4.3.0 | MIT License | https://tailwindcss.com */
 @layer properties{@supports (((-webkit-hyphens:none)) and (not (margin-trim:inline))) or ((-moz-orient:inline) and (not (color:rgb(from red r g b)))){*,:before,:after,::backdrop{--tw-rotate-x:initial;--tw-rotate-y:initial;--tw-rotate-z:initial;--tw-skew-x:initial;--tw-skew-y:initial;--tw-space-y-reverse:0;--tw-border-style:solid;--tw-leading:initial;--tw-font-weight:initial;--tw-tracking:initial;--tw-ordinal:initial;--tw-slashed-zero:initial;--tw-numeric-figure:initial;--tw-numeric-spacing:initial;--tw-numeric-fraction:initial;--tw-shadow:0 0 #0000;--tw-shadow-color:initial;--tw-shadow-alpha:100%;--tw-inset-shadow:0 0 #0000;--tw-inset-shadow-color:initial;--tw-inset-shadow-alpha:100%;--tw-ring-color:initial;--tw-ring-shadow:0 0 #0000;--tw-inset-ring-color:initial;--tw-inset-ring-shadow:0 0 #0000;--tw-ring-inset:initial;--tw-ring-offset-width:0px;--tw-ring-offset-color:#fff;--tw-ring-offset-shadow:0 0 #0000;--tw-outline-style:solid;--tw-blur:initial;--tw-brightness:initial;--tw-contrast:initial;--tw-grayscale:initial;--tw-hue-rotate:initial;--tw-invert:initial;--tw-opacity:initial;--tw-saturate:initial;--tw-sepia:initial;--tw-drop-shadow:initial;--tw-drop-shadow-color:initial;--tw-drop-shadow-alpha:100%;--tw-drop-shadow-size:initial;--tw-backdrop-blur:initial;--tw-backdrop-brightness:initial;--tw-backdrop-contrast:initial;--tw-backdrop-grayscale:initial;--tw-backdrop-hue-rotate:initial;--tw-backdrop-invert:initial;--tw-backdrop-opacity:initial;--tw-backdrop-saturate:initial;--tw-backdrop-sepia:initial;--tw-duration:initial;--tw-content:""}}}@layer theme{:root,:host{--color-white:#fff;--spacing:.25rem;--text-sm:.875rem;--text-sm--line-height:calc(1.25 / .875);--font-weight-light:300;--font-weight-medium:500;--font-weight-semibold:600;--font-weight-bold:700;--tracking-tight:-.025em;--tracking-normal:0em;--leading-tight:1.25;--leading-snug:1.375;--radius-sm:.25rem;--ease-out:cubic-bezier(0, 0, .2, 1);--blur-sm:8px;--default-transition-duration:.15s;--default-transition-timing-function:cubic-bezier(.4, 0, .2, 1);--default-font-family:var(--sans);--default-mono-font-family:var(--mono)}}@layer base{*,:after,:before,::backdrop{box-sizing:border-box;border:0 solid;margin:0;padding:0}::file-selector-button{box-sizing:border-box;border:0 solid;margin:0;padding:0}html,:host{-webkit-text-size-adjust:100%;tab-size:4;line-height:1.5;font-family:var(--default-font-family,ui-sans-serif, system-ui, sans-serif, "Apple Color Emoji", "Segoe UI Emoji", "Segoe UI Symbol", "Noto Color Emoji");font-feature-settings:var(--default-font-feature-settings,normal);font-variation-settings:var(--default-font-variation-settings,normal);-webkit-tap-highlight-color:transparent}hr{height:0;color:inherit;border-top-width:1px}abbr:where([title]){-webkit-text-decoration:underline dotted;text-decoration:underline dotted}h1,h2,h3,h4,h5,h6{font-size:inherit;font-weight:inherit}a{color:inherit;-webkit-text-decoration:inherit;-webkit-text-decoration:inherit;-webkit-text-decoration:inherit;text-decoration:inherit}b,strong{font-weight:bolder}code,kbd,samp,pre{font-family:var(--default-mono-font-family,ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, "Liberation Mono", "Courier New", monospace);font-feature-settings:var(--default-mono-font-feature-settings,normal);font-variation-settings:var(--default-mono-font-variation-settings,normal);font-size:1em}small{font-size:80%}sub,sup{vertical-align:baseline;font-size:75%;line-height:0;position:relative}sub{bottom:-.25em}sup{top:-.5em}table{text-indent:0;border-color:inherit;border-collapse:collapse}:-moz-focusring{outline:auto}progress{vertical-align:baseline}summary{display:list-item}ol,ul,menu{list-style:none}img,svg,video,canvas,audio,iframe,embed,object{vertical-align:middle;display:block}img,video{max-width:100%;height:auto}button,input,select,optgroup,textarea{font:inherit;font-feature-settings:inherit;font-variation-settings:inherit;letter-spacing:inherit;color:inherit;opacity:1;background-color:#0000;border-radius:0}::file-selector-button{font:inherit;font-feature-settings:inherit;font-variation-settings:inherit;letter-spacing:inherit;color:inherit;opacity:1;background-color:#0000;border-radius:0}:where(select:is([multiple],[size])) optgroup{font-weight:bolder}:where(select:is([multiple],[size])) optgroup option{padding-inline-start:20px}::file-selector-button{margin-inline-end:4px}::placeholder{opacity:1}@supports (not ((-webkit-appearance:-apple-pay-button))) or (contain-intrinsic-size:1px){::placeholder{color:currentColor}@supports (color:color-mix(in lab, red, red)){::placeholder{color:color-mix(in oklab, currentcolor 50%, transparent)}}}textarea{resize:vertical}::-webkit-search-decoration{-webkit-appearance:none}::-webkit-date-and-time-value{min-height:1lh;text-align:inherit}::-webkit-datetime-edit{display:inline-flex}::-webkit-datetime-edit-fields-wrapper{padding:0}::-webkit-datetime-edit{padding-block:0}::-webkit-datetime-edit-year-field{padding-block:0}::-webkit-datetime-edit-month-field{padding-block:0}::-webkit-datetime-edit-day-field{padding-block:0}::-webkit-datetime-edit-hour-field{padding-block:0}::-webkit-datetime-edit-minute-field{padding-block:0}::-webkit-datetime-edit-second-field{padding-block:0}::-webkit-datetime-edit-millisecond-field{padding-block:0}::-webkit-datetime-edit-meridiem-field{padding-block:0}::-webkit-calendar-picker-indicator{line-height:1}:-moz-ui-invalid{box-shadow:none}button,input:where([type=button],[type=reset],[type=submit]){appearance:button}::file-selector-button{appearance:button}::-webkit-inner-spin-button{height:auto}::-webkit-outer-spin-button{height:auto}[hidden]:where(:not([hidden=until-found])){display:none!important}:root{--bg:#f5f5f5;--panel:#fff;--panel2:#f0f0f0;--fg:#000;--muted:#555;--faint:#707070;--border:#e0e0e0;--border2:#bdbdbd;--row-hover:#f0f0f0;--accent:#d71921;--accent-soft:#d719210d;--link:#0050c0;--node-app:#000;--node-lib:#707070;--edge:#bdbdbd;--edge-faint:#e0e0e0;--mono:ui-monospace, "SF Mono", "JetBrains Mono", "Cascadia Mono", "Roboto Mono", Menlo, Consolas, monospace;--sans:system-ui, -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, "Helvetica Neue", sans-serif}@media (prefers-color-scheme:dark){:root{--bg:#141414;--panel:#1c1c1c;--panel2:#242424;--fg:#fff;--muted:#b8b8b8;--faint:#8a8a8a;--border:#2e2e2e;--border2:#3e3e3e;--row-hover:#1f1f1f;--accent:#ff4d54;--accent-soft:#ff4d5414;--link:#7eb0f9;--node-app:#fff;--node-lib:#8a8a8a;--edge:#3e3e3e;--edge-faint:#2e2e2e}}html[data-theme=light]{--bg:#f5f5f5;--panel:#fff;--panel2:#f0f0f0;--fg:#000;--muted:#555;--faint:#707070;--border:#e0e0e0;--border2:#bdbdbd;--row-hover:#f0f0f0;--accent:#d71921;--accent-soft:#d719210d;--link:#0050c0;--node-app:#000;--node-lib:#707070;--edge:#bdbdbd;--edge-faint:#e0e0e0}html[data-theme=dark]{--bg:#141414;--panel:#1c1c1c;--panel2:#242424;--fg:#fff;--muted:#b8b8b8;--faint:#8a8a8a;--border:#2e2e2e;--border2:#3e3e3e;--row-hover:#1f1f1f;--accent:#ff4d54;--accent-soft:#ff4d5414;--link:#7eb0f9;--node-app:#fff;--node-lib:#8a8a8a;--edge:#3e3e3e;--edge-faint:#2e2e2e}body{background-image:radial-gradient(circle, var(--border) .5px, transparent .5px);font-feature-settings:"ss01";background-size:14px 14px}}@layer components{.tbtn-theme [data-icon=moon]{display:inline-flex}.tbtn-theme [data-icon=sun]{display:none}@media (prefers-color-scheme:dark){.tbtn-theme [data-icon=moon]{display:none}.tbtn-theme [data-icon=sun]{display:inline-flex}}html[data-theme=light] .tbtn-theme [data-icon=moon]{display:inline-flex}html[data-theme=light] .tbtn-theme [data-icon=sun],html[data-theme=dark] .tbtn-theme [data-icon=moon]{display:none}html[data-theme=dark] .tbtn-theme [data-icon=sun]{display:inline-flex}.anolilab-logo{width:auto;height:13px;fill:var(--fg)}.anolilab-accent{fill:#dfff1b}}@layer utilities{.pointer-events-auto{pointer-events:auto}.pointer-events-none{pointer-events:none}.collapse{visibility:collapse}.invisible{visibility:hidden}.visible{visibility:visible}.absolute{position:absolute}.fixed{position:fixed}.relative{position:relative}.static{position:static}.sticky{position:sticky}.inset-0{inset:calc(var(--spacing) * 0)}.inset-x-0{inset-inline:calc(var(--spacing) * 0)}.top-0{top:calc(var(--spacing) * 0)}.top-3{top:calc(var(--spacing) * 3)}.top-4{top:calc(var(--spacing) * 4)}.top-full{top:100%}.right-0{right:calc(var(--spacing) * 0)}.right-4{right:calc(var(--spacing) * 4)}.bottom-4{bottom:calc(var(--spacing) * 4)}.bottom-5{bottom:calc(var(--spacing) * 5)}.left-0{left:calc(var(--spacing) * 0)}.left-4{left:calc(var(--spacing) * 4)}.isolate{isolation:isolate}.z-20{z-index:20}.z-30{z-index:30}.z-\\[2\\]{z-index:2}.container{width:100%}@media (min-width:40rem){.container{max-width:40rem}}@media (min-width:48rem){.container{max-width:48rem}}@media (min-width:64rem){.container{max-width:64rem}}@media (min-width:80rem){.container{max-width:80rem}}@media (min-width:96rem){.container{max-width:96rem}}.mx-1{margin-inline:calc(var(--spacing) * 1)}.mx-12{margin-inline:calc(var(--spacing) * 12)}.mx-\\[0\\.12em\\]{margin-inline:.12em}.mx-auto{margin-inline:auto}.mt-1{margin-top:calc(var(--spacing) * 1)}.mt-2{margin-top:calc(var(--spacing) * 2)}.mt-3{margin-top:calc(var(--spacing) * 3)}.mt-4{margin-top:calc(var(--spacing) * 4)}.mt-6{margin-top:calc(var(--spacing) * 6)}.mt-12{margin-top:calc(var(--spacing) * 12)}.mb-1{margin-bottom:calc(var(--spacing) * 1)}.mb-2{margin-bottom:calc(var(--spacing) * 2)}.mb-3{margin-bottom:calc(var(--spacing) * 3)}.mb-4{margin-bottom:calc(var(--spacing) * 4)}.mb-6{margin-bottom:calc(var(--spacing) * 6)}.mb-10{margin-bottom:calc(var(--spacing) * 10)}.ml-2{margin-left:calc(var(--spacing) * 2)}.ml-8{margin-left:calc(var(--spacing) * 8)}.ml-auto{margin-left:auto}.block{display:block}.contents{display:contents}.flex{display:flex}.grid{display:grid}.hidden{display:none}.inline{display:inline}.inline-block{display:inline-block}.inline-flex{display:inline-flex}.table{display:table}.size-\\[7px\\]{width:7px;height:7px}.h-2{height:calc(var(--spacing) * 2)}.h-5{height:calc(var(--spacing) * 5)}.h-7{height:calc(var(--spacing) * 7)}.h-9{height:calc(var(--spacing) * 9)}.h-10{height:calc(var(--spacing) * 10)}.h-11{height:calc(var(--spacing) * 11)}.h-\\[6px\\]{height:6px}.h-\\[7px\\]{height:7px}.h-\\[8px\\]{height:8px}.h-\\[10px\\]{height:10px}.h-\\[18px\\]{height:18px}.h-full{height:100%}.h-px{height:1px}.max-h-72{max-height:calc(var(--spacing) * 72)}.min-h-\\[400px\\]{min-height:400px}.min-h-\\[480px\\]{min-height:480px}.min-h-screen{min-height:100vh}.w-2{width:calc(var(--spacing) * 2)}.w-3{width:calc(var(--spacing) * 3)}.w-4{width:calc(var(--spacing) * 4)}.w-7{width:calc(var(--spacing) * 7)}.w-9{width:calc(var(--spacing) * 9)}.w-\\[7px\\]{width:7px}.w-\\[8px\\]{width:8px}.w-full{width:100%}.w-px{width:1px}.max-w-\\[380px\\]{max-width:380px}.max-w-\\[1080px\\]{max-width:1080px}.min-w-0{min-width:calc(var(--spacing) * 0)}.min-w-5{min-width:calc(var(--spacing) * 5)}.min-w-\\[200px\\]{min-width:200px}.min-w-\\[220px\\]{min-width:220px}.min-w-\\[260px\\]{min-width:260px}.flex-1{flex:1}.flex-\\[1_1_280px\\]{flex:280px}.flex-auto{flex:auto}.flex-none{flex:none}.shrink{flex-shrink:1}.shrink-0{flex-shrink:0}.grow{flex-grow:1}.caption-bottom{caption-side:bottom}.border-collapse{border-collapse:collapse}.transform{transform:var(--tw-rotate-x,) var(--tw-rotate-y,) var(--tw-rotate-z,) var(--tw-skew-x,) var(--tw-skew-y,)}.cursor-move{cursor:move}.cursor-pointer{cursor:pointer}.resize{resize:both}.grid-cols-2{grid-template-columns:repeat(2,minmax(0,1fr))}.grid-cols-\\[72px_1fr\\]{grid-template-columns:72px 1fr}.flex-col{flex-direction:column}.flex-wrap{flex-wrap:wrap}.items-baseline{align-items:baseline}.items-center{align-items:center}.items-end{align-items:flex-end}.items-start{align-items:flex-start}.items-stretch{align-items:stretch}.justify-between{justify-content:space-between}.justify-center{justify-content:center}.gap-0{gap:calc(var(--spacing) * 0)}.gap-1{gap:calc(var(--spacing) * 1)}.gap-1\\.5{gap:calc(var(--spacing) * 1.5)}.gap-2{gap:calc(var(--spacing) * 2)}.gap-3{gap:calc(var(--spacing) * 3)}.gap-4{gap:calc(var(--spacing) * 4)}.gap-6{gap:calc(var(--spacing) * 6)}.gap-8{gap:calc(var(--spacing) * 8)}.gap-12{gap:calc(var(--spacing) * 12)}.gap-16{gap:calc(var(--spacing) * 16)}.gap-\\[0\\.65rem\\]{gap:.65rem}.gap-\\[2px\\]{gap:2px}.gap-\\[7px\\]{gap:7px}.gap-px{gap:1px}:where(.space-y-0\\.5>:not(:last-child)){--tw-space-y-reverse:0;margin-block-start:calc(calc(var(--spacing) * .5) * var(--tw-space-y-reverse));margin-block-end:calc(calc(var(--spacing) * .5) * calc(1 - var(--tw-space-y-reverse)))}.gap-x-3{column-gap:calc(var(--spacing) * 3)}.gap-x-6{column-gap:calc(var(--spacing) * 6)}.gap-y-1{row-gap:calc(var(--spacing) * 1)}.gap-y-2{row-gap:calc(var(--spacing) * 2)}.gap-y-3{row-gap:calc(var(--spacing) * 3)}.self-center{align-self:center}.truncate{text-overflow:ellipsis;white-space:nowrap;overflow:hidden}.overflow-auto{overflow:auto}.overflow-y-auto{overflow-y:auto}.rounded{border-radius:.25rem}.rounded-\\[3px\\]{border-radius:3px}.rounded-\\[4px\\]{border-radius:4px}.rounded-full{border-radius:3.40282e38px}.rounded-sm{border-radius:var(--radius-sm)}.border{border-style:var(--tw-border-style);border-width:1px}.border-0{border-style:var(--tw-border-style);border-width:0}.border-t{border-top-style:var(--tw-border-style);border-top-width:1px}.border-b{border-bottom-style:var(--tw-border-style);border-bottom-width:1px}.border-l-2{border-left-style:var(--tw-border-style);border-left-width:2px}.border-dashed{--tw-border-style:dashed;border-style:dashed}.border-accent,.border-accent\\/60{border-color:var(--accent)}@supports (color:color-mix(in lab, red, red)){.border-accent\\/60{border-color:color-mix(in oklab, var(--accent) 60%, transparent)}}.border-border{border-color:var(--border)}.border-border2{border-color:var(--border2)}.border-fg{border-color:var(--fg)}.border-link{border-color:var(--link)}.bg-accent{background-color:var(--accent)}.bg-accent-soft{background-color:var(--accent-soft)}.bg-accent\\/40{background-color:var(--accent)}@supports (color:color-mix(in lab, red, red)){.bg-accent\\/40{background-color:color-mix(in oklab, var(--accent) 40%, transparent)}}.bg-bg,.bg-bg\\/40{background-color:var(--bg)}@supports (color:color-mix(in lab, red, red)){.bg-bg\\/40{background-color:color-mix(in oklab, var(--bg) 40%, transparent)}}.bg-border{background-color:var(--border)}.bg-border2{background-color:var(--border2)}.bg-edge{background-color:var(--edge)}.bg-edge-faint{background-color:var(--edge-faint)}.bg-fg{background-color:var(--fg)}.bg-node-app{background-color:var(--node-app)}.bg-node-lib{background-color:var(--node-lib)}.bg-panel,.bg-panel\\/95{background-color:var(--panel)}@supports (color:color-mix(in lab, red, red)){.bg-panel\\/95{background-color:color-mix(in oklab, var(--panel) 95%, transparent)}}.bg-panel2{background-color:var(--panel2)}.bg-transparent{background-color:#0000}.p-0{padding:calc(var(--spacing) * 0)}.p-5{padding:calc(var(--spacing) * 5)}.p-6{padding:calc(var(--spacing) * 6)}.px-0{padding-inline:calc(var(--spacing) * 0)}.px-0\\.5{padding-inline:calc(var(--spacing) * .5)}.px-1{padding-inline:calc(var(--spacing) * 1)}.px-1\\.5{padding-inline:calc(var(--spacing) * 1.5)}.px-2{padding-inline:calc(var(--spacing) * 2)}.px-3{padding-inline:calc(var(--spacing) * 3)}.px-4{padding-inline:calc(var(--spacing) * 4)}.px-5{padding-inline:calc(var(--spacing) * 5)}.px-6{padding-inline:calc(var(--spacing) * 6)}.px-8{padding-inline:calc(var(--spacing) * 8)}.px-12{padding-inline:calc(var(--spacing) * 12)}.px-\\[5px\\]{padding-inline:5px}.px-\\[6px\\]{padding-inline:6px}.py-0\\.5{padding-block:calc(var(--spacing) * .5)}.py-1{padding-block:calc(var(--spacing) * 1)}.py-2{padding-block:calc(var(--spacing) * 2)}.py-2\\.5{padding-block:calc(var(--spacing) * 2.5)}.py-3{padding-block:calc(var(--spacing) * 3)}.py-4{padding-block:calc(var(--spacing) * 4)}.py-5{padding-block:calc(var(--spacing) * 5)}.py-6{padding-block:calc(var(--spacing) * 6)}.py-8{padding-block:calc(var(--spacing) * 8)}.py-12{padding-block:calc(var(--spacing) * 12)}.py-16{padding-block:calc(var(--spacing) * 16)}.py-\\[3px\\]{padding-block:3px}.py-px{padding-block:1px}.pt-0\\.5{padding-top:calc(var(--spacing) * .5)}.pt-1{padding-top:calc(var(--spacing) * 1)}.pt-2{padding-top:calc(var(--spacing) * 2)}.pt-5{padding-top:calc(var(--spacing) * 5)}.pt-7{padding-top:calc(var(--spacing) * 7)}.pt-8{padding-top:calc(var(--spacing) * 8)}.pt-12{padding-top:calc(var(--spacing) * 12)}.pr-0{padding-right:calc(var(--spacing) * 0)}.pr-2{padding-right:calc(var(--spacing) * 2)}.pr-3{padding-right:calc(var(--spacing) * 3)}.pr-6{padding-right:calc(var(--spacing) * 6)}.pb-1{padding-bottom:calc(var(--spacing) * 1)}.pb-1\\.5{padding-bottom:calc(var(--spacing) * 1.5)}.pb-4{padding-bottom:calc(var(--spacing) * 4)}.pb-5{padding-bottom:calc(var(--spacing) * 5)}.pb-6{padding-bottom:calc(var(--spacing) * 6)}.pb-8{padding-bottom:calc(var(--spacing) * 8)}.pb-12{padding-bottom:calc(var(--spacing) * 12)}.pl-0{padding-left:calc(var(--spacing) * 0)}.pl-3{padding-left:calc(var(--spacing) * 3)}.pl-4{padding-left:calc(var(--spacing) * 4)}.pl-\\[7px\\]{padding-left:7px}.text-center{text-align:center}.text-left{text-align:left}.text-right{text-align:right}.align-middle{vertical-align:middle}.align-top{vertical-align:top}.font-mono{font-family:var(--mono)}.font-sans{font-family:var(--sans)}.text-sm{font-size:var(--text-sm);line-height:var(--tw-leading,var(--text-sm--line-height))}.text-\\[9px\\]{font-size:9px}.text-\\[10px\\]{font-size:10px}.text-\\[11px\\]{font-size:11px}.text-\\[12px\\]{font-size:12px}.text-\\[13px\\]{font-size:13px}.text-\\[14px\\]{font-size:14px}.text-\\[15px\\]{font-size:15px}.text-\\[22px\\]{font-size:22px}.text-\\[28px\\]{font-size:28px}.text-\\[44px\\]{font-size:44px}.text-\\[72px\\]{font-size:72px}.text-\\[clamp\\(28px\\,5vw\\,52px\\)\\]{font-size:clamp(28px,5vw,52px)}.leading-\\[0\\.9\\]{--tw-leading:.9;line-height:.9}.leading-none{--tw-leading:1;line-height:1}.leading-snug{--tw-leading:var(--leading-snug);line-height:var(--leading-snug)}.leading-tight{--tw-leading:var(--leading-tight);line-height:var(--leading-tight)}.font-bold{--tw-font-weight:var(--font-weight-bold);font-weight:var(--font-weight-bold)}.font-light{--tw-font-weight:var(--font-weight-light);font-weight:var(--font-weight-light)}.font-medium{--tw-font-weight:var(--font-weight-medium);font-weight:var(--font-weight-medium)}.font-semibold{--tw-font-weight:var(--font-weight-semibold);font-weight:var(--font-weight-semibold)}.tracking-\\[-0\\.02em\\]{--tw-tracking:-.02em;letter-spacing:-.02em}.tracking-\\[0\\.1em\\]{--tw-tracking:.1em;letter-spacing:.1em}.tracking-\\[0\\.05em\\]{--tw-tracking:.05em;letter-spacing:.05em}.tracking-\\[0\\.08em\\]{--tw-tracking:.08em;letter-spacing:.08em}.tracking-\\[0\\.11em\\]{--tw-tracking:.11em;letter-spacing:.11em}.tracking-\\[0\\.12em\\]{--tw-tracking:.12em;letter-spacing:.12em}.tracking-\\[0\\.15em\\]{--tw-tracking:.15em;letter-spacing:.15em}.tracking-\\[0\\.16em\\]{--tw-tracking:.16em;letter-spacing:.16em}.tracking-\\[0\\.22em\\]{--tw-tracking:.22em;letter-spacing:.22em}.tracking-normal{--tw-tracking:var(--tracking-normal);letter-spacing:var(--tracking-normal)}.tracking-tight{--tw-tracking:var(--tracking-tight);letter-spacing:var(--tracking-tight)}.break-words{overflow-wrap:break-word}.break-all{word-break:break-all}.whitespace-nowrap{white-space:nowrap}.text-accent{color:var(--accent)}.text-bg{color:var(--bg)}.text-faint{color:var(--faint)}.text-fg{color:var(--fg)}.text-link{color:var(--link)}.text-muted{color:var(--muted)}.capitalize{text-transform:capitalize}.lowercase{text-transform:lowercase}.normal-case{text-transform:none}.uppercase{text-transform:uppercase}.italic{font-style:italic}.tabular-nums{--tw-numeric-spacing:tabular-nums;font-variant-numeric:var(--tw-ordinal,) var(--tw-slashed-zero,) var(--tw-numeric-figure,) var(--tw-numeric-spacing,) var(--tw-numeric-fraction,)}.no-underline{text-decoration-line:none}.opacity-40{opacity:.4}.opacity-70{opacity:.7}.shadow{--tw-shadow:0 1px 3px 0 var(--tw-shadow-color,#0000001a), 0 1px 2px -1px var(--tw-shadow-color,#0000001a);box-shadow:var(--tw-inset-shadow), var(--tw-inset-ring-shadow), var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow)}.shadow-\\[0_4px_12px_rgba\\(0\\,0\\,0\\,0\\.08\\)\\]{--tw-shadow:0 4px 12px var(--tw-shadow-color,#00000014);box-shadow:var(--tw-inset-shadow), var(--tw-inset-ring-shadow), var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow)}.shadow-\\[0_8px_24px_rgba\\(0\\,0\\,0\\,0\\.12\\)\\]{--tw-shadow:0 8px 24px var(--tw-shadow-color,#0000001f);box-shadow:var(--tw-inset-shadow), var(--tw-inset-ring-shadow), var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow)}.ring{--tw-ring-shadow:var(--tw-ring-inset,) 0 0 0 calc(1px + var(--tw-ring-offset-width)) var(--tw-ring-color,currentcolor);box-shadow:var(--tw-inset-shadow), var(--tw-inset-ring-shadow), var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow)}.outline{outline-style:var(--tw-outline-style);outline-width:1px}.outline-0{outline-style:var(--tw-outline-style);outline-width:0}.blur{--tw-blur:blur(8px);filter:var(--tw-blur,) var(--tw-brightness,) var(--tw-contrast,) var(--tw-grayscale,) var(--tw-hue-rotate,) var(--tw-invert,) var(--tw-saturate,) var(--tw-sepia,) var(--tw-drop-shadow,)}.invert{--tw-invert:invert(100%);filter:var(--tw-blur,) var(--tw-brightness,) var(--tw-contrast,) var(--tw-grayscale,) var(--tw-hue-rotate,) var(--tw-invert,) var(--tw-saturate,) var(--tw-sepia,) var(--tw-drop-shadow,)}.filter{filter:var(--tw-blur,) var(--tw-brightness,) var(--tw-contrast,) var(--tw-grayscale,) var(--tw-hue-rotate,) var(--tw-invert,) var(--tw-saturate,) var(--tw-sepia,) var(--tw-drop-shadow,)}.backdrop-blur-sm{--tw-backdrop-blur:blur(var(--blur-sm));-webkit-backdrop-filter:var(--tw-backdrop-blur,) var(--tw-backdrop-brightness,) var(--tw-backdrop-contrast,) var(--tw-backdrop-grayscale,) var(--tw-backdrop-hue-rotate,) var(--tw-backdrop-invert,) var(--tw-backdrop-opacity,) var(--tw-backdrop-saturate,) var(--tw-backdrop-sepia,);backdrop-filter:var(--tw-backdrop-blur,) var(--tw-backdrop-brightness,) var(--tw-backdrop-contrast,) var(--tw-backdrop-grayscale,) var(--tw-backdrop-hue-rotate,) var(--tw-backdrop-invert,) var(--tw-backdrop-opacity,) var(--tw-backdrop-saturate,) var(--tw-backdrop-sepia,)}.transition{transition-property:color,background-color,border-color,outline-color,text-decoration-color,fill,stroke,--tw-gradient-from,--tw-gradient-via,--tw-gradient-to,opacity,box-shadow,transform,translate,scale,rotate,filter,-webkit-backdrop-filter,backdrop-filter,display,content-visibility,overlay,pointer-events;transition-timing-function:var(--tw-ease,var(--default-transition-timing-function));transition-duration:var(--tw-duration,var(--default-transition-duration))}.transition-colors{transition-property:color,background-color,border-color,outline-color,text-decoration-color,fill,stroke,--tw-gradient-from,--tw-gradient-via,--tw-gradient-to;transition-timing-function:var(--tw-ease,var(--default-transition-timing-function));transition-duration:var(--tw-duration,var(--default-transition-duration))}.duration-150{--tw-duration:.15s;transition-duration:.15s}.select-none{-webkit-user-select:none;user-select:none}.group-data-\\[state\\=off\\]\\:opacity-30:is(:where(.group)[data-state=off] *){opacity:.3}.placeholder\\:text-faint::placeholder{color:var(--faint)}.before\\:absolute:before{content:var(--tw-content);position:absolute}.before\\:left-0:before{content:var(--tw-content);left:calc(var(--spacing) * 0)}.before\\:text-faint:before{content:var(--tw-content);color:var(--faint)}.before\\:content-\\[\\'→\\'\\]:before{--tw-content:"→";content:var(--tw-content)}.after\\:ml-auto:after{content:var(--tw-content);margin-left:auto}.after\\:font-mono:after{content:var(--tw-content);font-family:var(--mono)}.after\\:text-\\[9px\\]:after{content:var(--tw-content);font-size:9px}.after\\:tracking-\\[0\\.1em\\]:after{content:var(--tw-content);--tw-tracking:.1em;letter-spacing:.1em}.after\\:text-accent:after{content:var(--tw-content);color:var(--accent)}.after\\:content-\\[\\'ON\\'\\]:after{--tw-content:"ON";content:var(--tw-content)}.last\\:border-b-0:last-child{border-bottom-style:var(--tw-border-style);border-bottom-width:0}.focus-within\\:border-fg:focus-within{border-color:var(--fg)}@media (hover:hover){.hover\\:border-fg:hover{border-color:var(--fg)}.hover\\:bg-accent:hover{background-color:var(--accent)}.hover\\:bg-row-hover:hover{background-color:var(--row-hover)}.hover\\:text-accent:hover{color:var(--accent)}.hover\\:text-fg:hover{color:var(--fg)}.hover\\:text-white:hover{color:var(--color-white)}.hover\\:opacity-90:hover{opacity:.9}}.focus-visible\\:ring-1:focus-visible{--tw-ring-shadow:var(--tw-ring-inset,) 0 0 0 calc(1px + var(--tw-ring-offset-width)) var(--tw-ring-color,currentcolor);box-shadow:var(--tw-inset-shadow), var(--tw-inset-ring-shadow), var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow)}.focus-visible\\:ring-fg:focus-visible{--tw-ring-color:var(--fg)}.focus-visible\\:outline-none:focus-visible{--tw-outline-style:none;outline-style:none}.disabled\\:pointer-events-none:disabled{pointer-events:none}.disabled\\:opacity-40:disabled{opacity:.4}.aria-selected\\:bg-row-hover[aria-selected=true]{background-color:var(--row-hover)}.data-\\[open\\=false\\]\\:hidden[data-open=false]{display:none}.data-\\[pinned\\=true\\]\\:pointer-events-auto[data-pinned=true]{pointer-events:auto}.data-\\[pinned\\=true\\]\\:border-accent[data-pinned=true]{border-color:var(--accent)}.data-\\[state\\=off\\]\\:text-faint[data-state=off]{color:var(--faint)}.data-\\[state\\=off\\]\\:line-through[data-state=off]{text-decoration-line:line-through}.data-\\[state\\=off\\]\\:after\\:text-faint[data-state=off]:after{content:var(--tw-content);color:var(--faint)}.data-\\[state\\=off\\]\\:after\\:content-\\[\\'OFF\\'\\][data-state=off]:after{--tw-content:"OFF";content:var(--tw-content)}.data-\\[state\\=selected\\]\\:bg-row-hover[data-state=selected]{background-color:var(--row-hover)}.data-\\[state\\=zero\\]\\:text-accent[data-state=zero]{color:var(--accent)}@media (min-width:40rem){.sm\\:min-w-\\[320px\\]{min-width:320px}}@media (min-width:48rem){.md\\:grid-cols-2{grid-template-columns:repeat(2,minmax(0,1fr))}.md\\:grid-cols-4{grid-template-columns:repeat(4,minmax(0,1fr))}.md\\:grid-cols-\\[1\\.4fr_1fr\\]{grid-template-columns:1.4fr 1fr}}.\\[\\&_svg\\]\\:size-\\[14px\\] svg{width:14px;height:14px}.\\[\\&_svg\\]\\:shrink-0 svg{flex-shrink:0}.\\[\\&_tr\\]\\:border-b-0 tr{border-bottom-style:var(--tw-border-style);border-bottom-width:0}.\\[\\&\\>\\*\\+\\*\\]\\:ml-6>*+*{margin-left:calc(var(--spacing) * 6)}.\\[\\&\\>\\*\\+\\*\\]\\:border-l>*+*{border-left-style:var(--tw-border-style);border-left-width:1px}.\\[\\&\\>\\*\\+\\*\\]\\:border-border>*+*{border-color:var(--border)}.\\[\\&\\>\\*\\+\\*\\]\\:pl-6>*+*{padding-left:calc(var(--spacing) * 6)}.\\[\\&\\>td\\]\\:border-b>td{border-bottom-style:var(--tw-border-style);border-bottom-width:1px}.\\[\\&\\>td\\]\\:border-border>td{border-color:var(--border)}}@property --tw-rotate-x{syntax:"*";inherits:false}@property --tw-rotate-y{syntax:"*";inherits:false}@property --tw-rotate-z{syntax:"*";inherits:false}@property --tw-skew-x{syntax:"*";inherits:false}@property --tw-skew-y{syntax:"*";inherits:false}@property --tw-space-y-reverse{syntax:"*";inherits:false;initial-value:0}@property --tw-border-style{syntax:"*";inherits:false;initial-value:solid}@property --tw-leading{syntax:"*";inherits:false}@property --tw-font-weight{syntax:"*";inherits:false}@property --tw-tracking{syntax:"*";inherits:false}@property --tw-ordinal{syntax:"*";inherits:false}@property --tw-slashed-zero{syntax:"*";inherits:false}@property --tw-numeric-figure{syntax:"*";inherits:false}@property --tw-numeric-spacing{syntax:"*";inherits:false}@property --tw-numeric-fraction{syntax:"*";inherits:false}@property --tw-shadow{syntax:"*";inherits:false;initial-value:0 0 #0000}@property --tw-shadow-color{syntax:"*";inherits:false}@property --tw-shadow-alpha{syntax:"<percentage>";inherits:false;initial-value:100%}@property --tw-inset-shadow{syntax:"*";inherits:false;initial-value:0 0 #0000}@property --tw-inset-shadow-color{syntax:"*";inherits:false}@property --tw-inset-shadow-alpha{syntax:"<percentage>";inherits:false;initial-value:100%}@property --tw-ring-color{syntax:"*";inherits:false}@property --tw-ring-shadow{syntax:"*";inherits:false;initial-value:0 0 #0000}@property --tw-inset-ring-color{syntax:"*";inherits:false}@property --tw-inset-ring-shadow{syntax:"*";inherits:false;initial-value:0 0 #0000}@property --tw-ring-inset{syntax:"*";inherits:false}@property --tw-ring-offset-width{syntax:"<length>";inherits:false;initial-value:0}@property --tw-ring-offset-color{syntax:"*";inherits:false;initial-value:#fff}@property --tw-ring-offset-shadow{syntax:"*";inherits:false;initial-value:0 0 #0000}@property --tw-outline-style{syntax:"*";inherits:false;initial-value:solid}@property --tw-blur{syntax:"*";inherits:false}@property --tw-brightness{syntax:"*";inherits:false}@property --tw-contrast{syntax:"*";inherits:false}@property --tw-grayscale{syntax:"*";inherits:false}@property --tw-hue-rotate{syntax:"*";inherits:false}@property --tw-invert{syntax:"*";inherits:false}@property --tw-opacity{syntax:"*";inherits:false}@property --tw-saturate{syntax:"*";inherits:false}@property --tw-sepia{syntax:"*";inherits:false}@property --tw-drop-shadow{syntax:"*";inherits:false}@property --tw-drop-shadow-color{syntax:"*";inherits:false}@property --tw-drop-shadow-alpha{syntax:"<percentage>";inherits:false;initial-value:100%}@property --tw-drop-shadow-size{syntax:"*";inherits:false}@property --tw-backdrop-blur{syntax:"*";inherits:false}@property --tw-backdrop-brightness{syntax:"*";inherits:false}@property --tw-backdrop-contrast{syntax:"*";inherits:false}@property --tw-backdrop-grayscale{syntax:"*";inherits:false}@property --tw-backdrop-hue-rotate{syntax:"*";inherits:false}@property --tw-backdrop-invert{syntax:"*";inherits:false}@property --tw-backdrop-opacity{syntax:"*";inherits:false}@property --tw-backdrop-saturate{syntax:"*";inherits:false}@property --tw-backdrop-sepia{syntax:"*";inherits:false}@property --tw-duration{syntax:"*";inherits:false}@property --tw-content{syntax:"*";inherits:false;initial-value:""}`,Si=Object.defineProperty,Ke=b((n,e)=>Si(n,"name",{value:e,configurable:!0}),"d$1");const Ni=Ai,Ci=ni(import.meta.url),Xe=Ke((n,e)=>{const t=Ci.resolve(n);return qr(oi(ai(t),e),"utf8")},"readUmd"),_i=Xe("sigma","sigma.min.js"),Di=Xe("graphology","graphology.umd.min.js"),Mi=Xe("@floating-ui/core","floating-ui.core.umd.min.js"),Ii=Xe("@floating-ui/dom","floating-ui.dom.umd.min.js"),Li='<svg viewBox="0 0 24 24" width="14" height="14" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true" focusable="false"><path d="M21 12.79A9 9 0 1 1 11.21 3 7 7 0 0 0 21 12.79z"/></svg>',Ti='<svg viewBox="0 0 24 24" width="14" height="14" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true" focusable="false"><circle cx="12" cy="12" r="4"/><path d="M12 2v2m0 16v2M4.93 4.93l1.41 1.41m11.32 11.32 1.41 1.41M2 12h2m16 0h2M4.93 19.07l1.41-1.41m11.32-11.32 1.41-1.41"/></svg>',ce=Ke(n=>n.replaceAll("&","&amp;").replaceAll("<","&lt;").replaceAll(">","&gt;").replaceAll('"',"&quot;").replaceAll("'","&#39;"),"escapeHtml"),Oi=9,zi=4,Ri=Ke((n,e)=>{if(n.length===0)return[];const t=new P({multi:!0,type:"directed"});for(const o of n){const a=t.order/n.length*Math.PI*2;t.addNode(o.name,{path:o.path,size:o.type==="application"?Oi:zi,type:o.type,x:Math.cos(a),y:Math.sin(a)})}for(const o of e)t.hasNode(o.source)&&t.hasNode(o.target)&&t.addEdge(o.source,o.target,{type:o.type});const r=$t.inferSettings(t);$t.assign(t,{iterations:600,settings:{...r,adjustSizes:!0,barnesHutOptimize:t.order>100,gravity:1.2,linLogMode:!0,scalingRatio:8,slowDown:4}});const i=[];return t.forEachNode((o,a)=>{i.push({name:o,path:a.path,size:a.size,type:a.type,x:a.x,y:a.y})}),i},"computeLayout"),Ui=Ke(n=>{const e=n.now??new Date,t=n.nodes.filter(u=>u.type==="application").length,r=n.nodes.length-t,i=Ri(n.nodes,n.edges),o=new Set(i.map(u=>u.name)),a=n.edges.filter(u=>o.has(u.source)&&o.has(u.target)),s={edges:a,nodes:i},d=n.nodes.length===0,c={chip:"font-mono tracking-[0.08em] text-muted border border-border2 inline-flex h-7 items-center justify-center rounded-[4px] px-3 text-[11px] font-medium uppercase",dvNum:"font-mono text-[22px] font-medium text-fg leading-none",labelMono:"font-mono text-[10px] uppercase tracking-[0.15em] text-faint"};return`<!doctype html>
 <html lang="en">
 <head>