@enervance/insight-cim-model 0.0.373-beta2 → 0.0.373-beta21

package/dist/data-structures/graph/graph.d.ts

@@ -1,33 +1,33 @@
-import { GraphEdge } from './edges/GraphEdge.js';
-import { GraphNode } from './nodes/GraphNode.js';
-import { Connection } from './connections/connection.js';
-import { ResultBFS } from './graph-interfaces.js';
-import { GraphTree } from '../tree/GraphTree.js';
-import { GraphObject } from './GraphObject.js';
-import { GraphTreeObject } from '../tree/GraphTreeObject.js';
-import { IIdentifiedObject } from '../../interfaces/model/core/IIdentifiedObject.js';
-import { ModelContainer } from '../../model-container/model/ModelContainer.js';
-export declare class Graph {
-    cimModel: ModelContainer;
-    nodes: Map<string, GraphNode>;
-    edges: Map<string, GraphEdge>;
-    terminals: Map<string, Connection>;
-    constructor(cimModel: ModelContainer);
-    addNode(node: GraphNode): void;
-    addEdge(edge: GraphEdge): void;
-    addTerminal(terminal: Connection): void;
-    /** Breitensuche zur Bestimmung der Knotenerreichbarkeit (z.B Slack).
-     * @param startNode der Startknoten
-     * @param findObjectsID die IDs der zu suchenden Knoten
-     * @param createTree
-     * @return ResultBFS mit Ergebnis (gefunden und callstack) */
-    breadthFirstSearch(startNode: GraphObject, findObjectsID: string[], createTree?: boolean): ResultBFS;
-    createTreeBFS(startNodeID: string): GraphTree;
-    addParentEdgeChildNodeBFS(tree: GraphTree, parentID: string, child: GraphNode): void;
-    /** Graph-Initialiserung über eine Breitentraversierung */
-    addParentNodeChildEdgeBFS(tree: GraphTree, parentID: string, child: GraphEdge): void;
-    getNode(id: string): GraphNode;
-    getObject(id: string): any;
-    handleCompoundChildVL(tree: GraphTree, cimObject: IIdentifiedObject, treeObject: GraphTreeObject): void;
-    handleCompoundChild(tree: GraphTree, cimObject: IIdentifiedObject, treeObject: GraphTreeObject): void;
-}
+import { GraphEdge } from './edges/GraphEdge.js';
+import { GraphNode } from './nodes/GraphNode.js';
+import { Connection } from './connections/connection.js';
+import { ResultBFS } from './graph-interfaces.js';
+import { GraphTree } from '../tree/GraphTree.js';
+import { GraphObject } from './GraphObject.js';
+import { GraphTreeObject } from '../tree/GraphTreeObject.js';
+import { IIdentifiedObject } from '../../interfaces/model/core/IIdentifiedObject.js';
+import { ModelContainer } from '../../model-container/model/ModelContainer.js';
+export declare class Graph {
+    cimModel: ModelContainer;
+    nodes: Map<string, GraphNode>;
+    edges: Map<string, GraphEdge>;
+    terminals: Map<string, Connection>;
+    constructor(cimModel: ModelContainer);
+    addNode(node: GraphNode): void;
+    addEdge(edge: GraphEdge): void;
+    addTerminal(terminal: Connection): void;
+    /** Breitensuche zur Bestimmung der Knotenerreichbarkeit (z.B Slack).
+     * @param startNode der Startknoten
+     * @param findObjectsID die IDs der zu suchenden Knoten
+     * @param createTree
+     * @return ResultBFS mit Ergebnis (gefunden und callstack) */
+    breadthFirstSearch(startNode: GraphObject, findObjectsID: string[], createTree?: boolean): ResultBFS;
+    createTreeBFS(startNodeID: string): GraphTree;
+    addParentEdgeChildNodeBFS(tree: GraphTree, parentID: string, child: GraphNode): void;
+    /** Graph-Initialiserung über eine Breitentraversierung */
+    addParentNodeChildEdgeBFS(tree: GraphTree, parentID: string, child: GraphEdge): void;
+    getNode(id: string): GraphNode;
+    getObject(id: string): any;
+    handleCompoundChildVL(tree: GraphTree, cimObject: IIdentifiedObject, treeObject: GraphTreeObject): void;
+    handleCompoundChild(tree: GraphTree, cimObject: IIdentifiedObject, treeObject: GraphTreeObject): void;
+}

package/dist/data-structures/graph/graph.js

@@ -1,173 +1,173 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Graph = void 0;
-const GraphTree_1 = require("../tree/GraphTree.js");
-const GraphTreeNode_1 = require("../tree/GraphTreeNode.js");
-const GraphTreeEdge_1 = require("../tree/GraphTreeEdge.js");
-const ConnectivityNode_1 = require("../../model/core/ConnectivityNode.js");
-class Graph {
-    constructor(cimModel) {
-        this.nodes = new Map();
-        this.edges = new Map();
-        this.terminals = new Map();
-        this.cimModel = cimModel;
-    }
-    addNode(node) {
-        this.nodes.set(node.id, node);
-    }
-    addEdge(edge) {
-        this.edges.set(edge.id, edge);
-    }
-    addTerminal(terminal) {
-        this.terminals.set(terminal.id, terminal);
-    }
-    /** Breitensuche zur Bestimmung der Knotenerreichbarkeit (z.B Slack).
-     * @param startNode der Startknoten
-     * @param findObjectsID die IDs der zu suchenden Knoten
-     * @param createTree
-     * @return ResultBFS mit Ergebnis (gefunden und callstack) */
-    breadthFirstSearch(startNode, findObjectsID, createTree) {
-        let pathNodeList = [];
-        let nodesOnCurrentLevel;
-        let nodesOnNextLevel = [startNode];
-        let nodesVisited = [];
-        let foundNode = false;
-        const visitedStations = [];
-        const tree = createTree ? new GraphTree_1.GraphTree() : undefined;
-        if (tree) {
-            const rootNode = new GraphTreeNode_1.GraphTreeNode(startNode.id, startNode.data);
-            this.handleCompoundChild(tree, this.cimModel.getObject(startNode.id), rootNode);
-            tree.setRootNode(rootNode);
-        }
-        while (!foundNode) {
-            nodesOnCurrentLevel = [];
-            nodesOnCurrentLevel = [...nodesOnNextLevel];
-            /** aus der Liste entfernen */
-            nodesOnNextLevel = [];
-            /** gibt nichts mehr zu entdecken, breche ab */
-            if (nodesOnCurrentLevel.length === 0)
-                break;
-            for (const currentNode of nodesOnCurrentLevel) {
-                nodesVisited.push(currentNode.id);
-                /** Wenn gefunden, dann abbruch*/
-                if (foundNode)
-                    break;
-                /** Wenn nicht traversierbar, dann nächster Knoten */
-                if (!currentNode.canPassThrough())
-                    continue;
-                for (const terminal of currentNode.terminals.values()) {
-                    /** Terminal traversierbar und nicht besucht */
-                    if (terminal.canPassThrough() && nodesVisited.indexOf(terminal.id) === -1) {
-                        nodesVisited.push(terminal.id);
-                        /** Das gesuchte Objekt? */
-                        if (findObjectsID.indexOf(terminal.edge.id) !== -1 || findObjectsID.indexOf(terminal.node.id) !== -1) {
-                            foundNode = true;
-                            break;
-                        }
-                        else {
-                            /** suche weiter, wenn der Knoten und/oder Kante traversierbar und nicht besucht */
-                            if (nodesVisited.indexOf(terminal.node.id) === -1 && terminal.node.canPassThrough()) {
-                                nodesOnNextLevel.push(terminal.node);
-                                if (tree)
-                                    this.addParentEdgeChildNodeBFS(tree, currentNode.id, terminal.node);
-                            }
-                            if (nodesVisited.indexOf(terminal.edge.id) === -1) {
-                                nodesOnNextLevel.push(terminal.edge);
-                                if (tree)
-                                    this.addParentNodeChildEdgeBFS(tree, currentNode.id, terminal.edge);
-                            }
-                        }
-                    }
-                }
-                if (currentNode.constructor.name.includes('GraphNode'))
-                    visitedStations.push(currentNode);
-            }
-        }
-        return {
-            found: foundNode,
-            nodesVisited: visitedStations,
-            tree: tree
-        };
-    }
-    createTreeBFS(startNodeID) {
-        const result = this.breadthFirstSearch(this.getObject(startNodeID), [], true);
-        /** Parent Child Associatons for Compoundselements */
-        result.tree.makeCompoundParentChildAssociatons();
-        const treeJSON = result.tree.toJSON(Array.from([...result.tree.compoundNodes.values()]));
-        result.nodesVisited.length = 0;
-        // result.tree = undefined;
-        return result.tree;
-    }
-    addParentEdgeChildNodeBFS(tree, parentID, child) {
-        const parentEdge = tree.getEdge(parentID);
-        if (tree.treeObjects.has(child.id)) {
-            const childNode = tree.getNode(child.id);
-            parentEdge.setTargetNode(childNode);
-            childNode.addBackwardNode(parentEdge.getStartNode());
-            childNode.addBackwardEdge(parentEdge);
-            parentEdge.getStartNode().addBackwardNode(childNode);
-            parentEdge.getStartNode().addBackwardEdge(parentEdge);
-        }
-        else {
-            const childNode = new GraphTreeNode_1.GraphTreeNode(child.id, child.data);
-            this.handleCompoundChild(tree, this.cimModel.getObject(child.id), childNode);
-            childNode.setParent(parentEdge.getStartNode());
-            parentEdge.getStartNode().addChildNode(childNode);
-            childNode.addIncomingEdge(parentEdge);
-            parentEdge.setTargetNode(childNode);
-            tree.addNode(childNode);
-        }
-    }
-    /** Graph-Initialiserung über eine Breitentraversierung */
-    addParentNodeChildEdgeBFS(tree, parentID, child) {
-        const parentNode = tree.getNode(parentID);
-        if (tree.treeObjects.has(child.id)) {
-            const childEdge = tree.getEdge(child.id);
-            childEdge.setTargetNode(parentNode);
-            childEdge.getStartNode().addBackwardNode(parentNode);
-            childEdge.getStartNode().addOutcomingEdge(childEdge);
-            childEdge.getStartNode().removeEdge(childEdge);
-            parentNode.addBackwardNode(childEdge.getStartNode());
-            childEdge.getStartNode().addBackwardNode(parentNode);
-        }
-        else {
-            const childEdge = new GraphTreeEdge_1.GraphTreeEdge(child.id, child.data);
-            childEdge.setStartNode(parentNode);
-            parentNode.addOutcomingEdge(childEdge);
-            tree.addEdge(childEdge);
-        }
-    }
-    getNode(id) {
-        return this.nodes.get(id);
-    }
-    getObject(id) {
-        if (this.terminals.has(id)) {
-            return this.terminals.get(id);
-        }
-        if (this.nodes.has(id)) {
-            return this.nodes.get(id);
-        }
-        if (this.edges.has(id)) {
-            return this.edges.get(id);
-        }
-    }
-    handleCompoundChildVL(tree, cimObject, treeObject) {
-        if (treeObject instanceof GraphTreeNode_1.GraphTreeNode) {
-            if (cimObject instanceof ConnectivityNode_1.ConnectivityNode) {
-                const cn = cimObject;
-                tree.addCompoundNodeElement(cn.getConnectivityNodeContainerUUID(), treeObject);
-            }
-        }
-    }
-    handleCompoundChild(tree, cimObject, treeObject) {
-        var _a, _b;
-        if (treeObject instanceof GraphTreeNode_1.GraphTreeNode) {
-            if (cimObject instanceof ConnectivityNode_1.ConnectivityNode) {
-                const cn = cimObject;
-                tree.addCompoundNodeElement((_b = (_a = cn.getVoltageLevel()) === null || _a === void 0 ? void 0 : _a.getSubstation()) === null || _b === void 0 ? void 0 : _b.getUUID(), treeObject);
-            }
-        }
-    }
-}
-exports.Graph = Graph;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Graph = void 0;
+const GraphTree_1 = require("../tree/GraphTree.js");
+const GraphTreeNode_1 = require("../tree/GraphTreeNode.js");
+const GraphTreeEdge_1 = require("../tree/GraphTreeEdge.js");
+const ConnectivityNode_1 = require("../../model/core/ConnectivityNode.js");
+class Graph {
+    constructor(cimModel) {
+        this.nodes = new Map();
+        this.edges = new Map();
+        this.terminals = new Map();
+        this.cimModel = cimModel;
+    }
+    addNode(node) {
+        this.nodes.set(node.id, node);
+    }
+    addEdge(edge) {
+        this.edges.set(edge.id, edge);
+    }
+    addTerminal(terminal) {
+        this.terminals.set(terminal.id, terminal);
+    }
+    /** Breitensuche zur Bestimmung der Knotenerreichbarkeit (z.B Slack).
+     * @param startNode der Startknoten
+     * @param findObjectsID die IDs der zu suchenden Knoten
+     * @param createTree
+     * @return ResultBFS mit Ergebnis (gefunden und callstack) */
+    breadthFirstSearch(startNode, findObjectsID, createTree) {
+        let pathNodeList = [];
+        let nodesOnCurrentLevel;
+        let nodesOnNextLevel = [startNode];
+        let nodesVisited = [];
+        let foundNode = false;
+        const visitedStations = [];
+        const tree = createTree ? new GraphTree_1.GraphTree() : undefined;
+        if (tree) {
+            const rootNode = new GraphTreeNode_1.GraphTreeNode(startNode.id, startNode.data);
+            this.handleCompoundChild(tree, this.cimModel.getObject(startNode.id), rootNode);
+            tree.setRootNode(rootNode);
+        }
+        while (!foundNode) {
+            nodesOnCurrentLevel = [];
+            nodesOnCurrentLevel = [...nodesOnNextLevel];
+            /** aus der Liste entfernen */
+            nodesOnNextLevel = [];
+            /** gibt nichts mehr zu entdecken, breche ab */
+            if (nodesOnCurrentLevel.length === 0)
+                break;
+            for (const currentNode of nodesOnCurrentLevel) {
+                nodesVisited.push(currentNode.id);
+                /** Wenn gefunden, dann abbruch*/
+                if (foundNode)
+                    break;
+                /** Wenn nicht traversierbar, dann nächster Knoten */
+                if (!currentNode.canPassThrough())
+                    continue;
+                for (const terminal of currentNode.terminals.values()) {
+                    /** Terminal traversierbar und nicht besucht */
+                    if (terminal.canPassThrough() && nodesVisited.indexOf(terminal.id) === -1) {
+                        nodesVisited.push(terminal.id);
+                        /** Das gesuchte Objekt? */
+                        if (findObjectsID.indexOf(terminal.edge.id) !== -1 || findObjectsID.indexOf(terminal.node.id) !== -1) {
+                            foundNode = true;
+                            break;
+                        }
+                        else {
+                            /** suche weiter, wenn der Knoten und/oder Kante traversierbar und nicht besucht */
+                            if (nodesVisited.indexOf(terminal.node.id) === -1 && terminal.node.canPassThrough()) {
+                                nodesOnNextLevel.push(terminal.node);
+                                if (tree)
+                                    this.addParentEdgeChildNodeBFS(tree, currentNode.id, terminal.node);
+                            }
+                            if (nodesVisited.indexOf(terminal.edge.id) === -1) {
+                                nodesOnNextLevel.push(terminal.edge);
+                                if (tree)
+                                    this.addParentNodeChildEdgeBFS(tree, currentNode.id, terminal.edge);
+                            }
+                        }
+                    }
+                }
+                if (currentNode.constructor.name.includes('GraphNode'))
+                    visitedStations.push(currentNode);
+            }
+        }
+        return {
+            found: foundNode,
+            nodesVisited: visitedStations,
+            tree: tree
+        };
+    }
+    createTreeBFS(startNodeID) {
+        const result = this.breadthFirstSearch(this.getObject(startNodeID), [], true);
+        /** Parent Child Associatons for Compoundselements */
+        result.tree.makeCompoundParentChildAssociatons();
+        const treeJSON = result.tree.toJSON(Array.from([...result.tree.compoundNodes.values()]));
+        result.nodesVisited.length = 0;
+        // result.tree = undefined;
+        return result.tree;
+    }
+    addParentEdgeChildNodeBFS(tree, parentID, child) {
+        const parentEdge = tree.getEdge(parentID);
+        if (tree.treeObjects.has(child.id)) {
+            const childNode = tree.getNode(child.id);
+            parentEdge.setTargetNode(childNode);
+            childNode.addBackwardNode(parentEdge.getStartNode());
+            childNode.addBackwardEdge(parentEdge);
+            parentEdge.getStartNode().addBackwardNode(childNode);
+            parentEdge.getStartNode().addBackwardEdge(parentEdge);
+        }
+        else {
+            const childNode = new GraphTreeNode_1.GraphTreeNode(child.id, child.data);
+            this.handleCompoundChild(tree, this.cimModel.getObject(child.id), childNode);
+            childNode.setParent(parentEdge.getStartNode());
+            parentEdge.getStartNode().addChildNode(childNode);
+            childNode.addIncomingEdge(parentEdge);
+            parentEdge.setTargetNode(childNode);
+            tree.addNode(childNode);
+        }
+    }
+    /** Graph-Initialiserung über eine Breitentraversierung */
+    addParentNodeChildEdgeBFS(tree, parentID, child) {
+        const parentNode = tree.getNode(parentID);
+        if (tree.treeObjects.has(child.id)) {
+            const childEdge = tree.getEdge(child.id);
+            childEdge.setTargetNode(parentNode);
+            childEdge.getStartNode().addBackwardNode(parentNode);
+            childEdge.getStartNode().addOutcomingEdge(childEdge);
+            childEdge.getStartNode().removeEdge(childEdge);
+            parentNode.addBackwardNode(childEdge.getStartNode());
+            childEdge.getStartNode().addBackwardNode(parentNode);
+        }
+        else {
+            const childEdge = new GraphTreeEdge_1.GraphTreeEdge(child.id, child.data);
+            childEdge.setStartNode(parentNode);
+            parentNode.addOutcomingEdge(childEdge);
+            tree.addEdge(childEdge);
+        }
+    }
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    getObject(id) {
+        if (this.terminals.has(id)) {
+            return this.terminals.get(id);
+        }
+        if (this.nodes.has(id)) {
+            return this.nodes.get(id);
+        }
+        if (this.edges.has(id)) {
+            return this.edges.get(id);
+        }
+    }
+    handleCompoundChildVL(tree, cimObject, treeObject) {
+        if (treeObject instanceof GraphTreeNode_1.GraphTreeNode) {
+            if (cimObject instanceof ConnectivityNode_1.ConnectivityNode) {
+                const cn = cimObject;
+                tree.addCompoundNodeElement(cn.getConnectivityNodeContainerUUID(), treeObject);
+            }
+        }
+    }
+    handleCompoundChild(tree, cimObject, treeObject) {
+        var _a, _b;
+        if (treeObject instanceof GraphTreeNode_1.GraphTreeNode) {
+            if (cimObject instanceof ConnectivityNode_1.ConnectivityNode) {
+                const cn = cimObject;
+                tree.addCompoundNodeElement((_b = (_a = cn.getVoltageLevel()) === null || _a === void 0 ? void 0 : _a.getSubstation()) === null || _b === void 0 ? void 0 : _b.getUUID(), treeObject);
+            }
+        }
+    }
+}
+exports.Graph = Graph;
 //# sourceMappingURL=graph.js.map

package/dist/data-structures/graph/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/data-structures/graph/graph.ts"],"names":[],"mappings":";;;AAIA,iDAA8C;AAE9C,yDAAsD;AACtD,yDAAsD;AACtD,wEAAqE;AAKrE,MAAa,KAAK;IAQhB,YAAY,QAAwB;QAJpC,UAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;QAC1C,UAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;QAC1C,cAAS,GAA4B,IAAI,GAAG,EAAE,CAAC;QAG7C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,WAAW,CAAC,QAAoB;QAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED;;;;iEAI6D;IAC7D,kBAAkB,CAAC,SAAsB,EAAE,aAAwB,EAAE,UAAoB;QACvF,IAAI,YAAY,GAAmB,EAAE,CAAC;QACtC,IAAI,mBAAmC,CAAC;QACxC,IAAI,gBAAgB,GAAmB,CAAC,SAAS,CAAC,CAAC;QACnD,IAAI,YAAY,GAAc,EAAE,CAAC;QACjC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,eAAe,GAAG,EAAE,CAAC;QAE3B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,qBAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtD,IAAI,IAAI,EAAE;YACR,MAAM,QAAQ,GAAG,IAAI,6BAAa,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;YACjE,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChF,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;SAC5B;QAED,OAAO,CAAC,SAAS,EAAE;YACjB,mBAAmB,GAAG,EAAE,CAAC;YACzB,mBAAmB,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC;YAC5C,8BAA8B;YAC9B,gBAAgB,GAAG,EAAE,CAAC;YAEtB,+CAA+C;YAC/C,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAE5C,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE;gBAC7C,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBAClC,iCAAiC;gBACjC,IAAI,SAAS;oBAAE,MAAM;gBACrB,qDAAqD;gBACrD,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE;oBAAE,SAAS;gBAE5C,KAAK,MAAM,QAAQ,IAAI,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;oBACrD,+CAA+C;oBAC/C,IAAI,QAAQ,CAAC,cAAc,EAAE,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;wBACzE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC/B,2BAA2B;wBAC3B,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;4BACpG,SAAS,GAAG,IAAI,CAAC;4BACjB,MAAM;yBACP;6BAAM;4BACL,mFAAmF;4BACnF,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE;gCACnF,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gCACrC,IAAI,IAAI;oCAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;6BAC/E;4BACD,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;gCACjD,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gCACrC,IAAI,IAAI;oCAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;6BAC/E;yBACF;qBACF;iBACF;gBACD,IAAI,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;oBAAE,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aAC3F;SACF;QAED,OAAO;YACL,KAAK,EAAE,SAAS;YAChB,YAAY,EAAE,eAAe;YAC7B,IAAI,EAAE,IAAI;SACX,CAAC;IACJ,CAAC;IAGM,aAAa,CAAC,WAAmB;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAE9E,qDAAqD;QACrD,MAAM,CAAC,IAAI,CAAC,kCAAkC,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,2BAA2B;QAC3B,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,yBAAyB,CAAC,IAAe,EAAE,QAAgB,EAAE,KAAgB;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzC,UAAU,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACpC,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;YACrD,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YAEtC,UAAU,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;YACrD,UAAU,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SACvD;aAAM;YACL,MAAM,SAAS,GAAG,IAAI,6BAAa,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YAE7E,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,UAAU,CAAC,YAAY,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YAClD,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACtC,UAAU,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;SACzB;IACH,CAAC;IAED,0DAA0D;IAC1D,yBAAyB,CAAC,IAAe,EAAE,QAAgB,EAAE,KAAgB;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzC,SAAS,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACpC,SAAS,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,UAAU,CAAC,eAAe,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SACtD;aAAM;YACL,MAAM,SAAS,GAAG,IAAI,6BAAa,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1D,SAAS,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YACnC,UAAU,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;SACzB;IACH,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,CAAC,EAAU;QAClB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC/B;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACtB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC3B;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACtB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC3B;IACH,CAAC;IAED,qBAAqB,CAAC,IAAe,EAAE,SAA4B,EAAE,UAA2B;QAC9F,IAAI,UAAU,YAAY,6BAAa,EAAE;YACvC,IAAI,SAAS,YAAY,mCAAgB,EAAE;gBACzC,MAAM,EAAE,GAAG,SAA6B,CAAC;gBACzC,IAAI,CAAC,sBAAsB,CAAC,EAAE,CAAC,gCAAgC,EAAE,EAAE,UAAU,CAAC,CAAC;aAChF;SACF;IACH,CAAC;IAED,mBAAmB,CAAC,IAAe,EAAE,SAA4B,EAAE,UAA2B;;QAC5F,IAAI,UAAU,YAAY,6BAAa,EAAE;YACvC,IAAI,SAAS,YAAY,mCAAgB,EAAE;gBACzC,MAAM,EAAE,GAAG,SAA6B,CAAC;gBACzC,IAAI,CAAC,sBAAsB,CAAC,MAAA,MAAA,EAAE,CAAC,eAAe,EAAE,0CAAE,aAAa,EAAE,0CAAE,OAAO,EAAE,EAAE,UAAU,CAAC,CAAC;aAC3F;SACF;IACH,CAAC;CAGF;AArLD,sBAqLC"}
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/data-structures/graph/graph.ts"],"names":[],"mappings":";;;AAIA,iDAA8C;AAE9C,yDAAsD;AACtD,yDAAsD;AACtD,wEAAqE;AAKrE,MAAa,KAAK;IAQhB,YAAY,QAAwB;QAJpC,UAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;QAC1C,UAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;QAC1C,cAAS,GAA4B,IAAI,GAAG,EAAE,CAAC;QAG7C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,WAAW,CAAC,QAAoB;QAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED;;;;iEAI6D;IAC7D,kBAAkB,CAAC,SAAsB,EAAE,aAAwB,EAAE,UAAoB;QACvF,IAAI,YAAY,GAAmB,EAAE,CAAC;QACtC,IAAI,mBAAmC,CAAC;QACxC,IAAI,gBAAgB,GAAmB,CAAC,SAAS,CAAC,CAAC;QACnD,IAAI,YAAY,GAAc,EAAE,CAAC;QACjC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,eAAe,GAAG,EAAE,CAAC;QAE3B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,qBAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,QAAQ,GAAG,IAAI,6BAAa,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;YACjE,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChF,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,CAAC,SAAS,EAAE,CAAC;YAClB,mBAAmB,GAAG,EAAE,CAAC;YACzB,mBAAmB,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC;YAC5C,8BAA8B;YAC9B,gBAAgB,GAAG,EAAE,CAAC;YAEtB,+CAA+C;YAC/C,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAE5C,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE,CAAC;gBAC9C,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBAClC,iCAAiC;gBACjC,IAAI,SAAS;oBAAE,MAAM;gBACrB,qDAAqD;gBACrD,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE;oBAAE,SAAS;gBAE5C,KAAK,MAAM,QAAQ,IAAI,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;oBACtD,+CAA+C;oBAC/C,IAAI,QAAQ,CAAC,cAAc,EAAE,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;wBAC1E,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC/B,2BAA2B;wBAC3B,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;4BACrG,SAAS,GAAG,IAAI,CAAC;4BACjB,MAAM;wBACR,CAAC;6BAAM,CAAC;4BACN,mFAAmF;4BACnF,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;gCACpF,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gCACrC,IAAI,IAAI;oCAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;4BAChF,CAAC;4BACD,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gCAClD,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gCACrC,IAAI,IAAI;oCAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;4BAChF,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,IAAI,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;oBAAE,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,SAAS;YAChB,YAAY,EAAE,eAAe;YAC7B,IAAI,EAAE,IAAI;SACX,CAAC;IACJ,CAAC;IAGM,aAAa,CAAC,WAAmB;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAE9E,qDAAqD;QACrD,MAAM,CAAC,IAAI,CAAC,kCAAkC,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,2BAA2B;QAC3B,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,yBAAyB,CAAC,IAAe,EAAE,QAAgB,EAAE,KAAgB;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzC,UAAU,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACpC,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;YACrD,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YAEtC,UAAU,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;YACrD,UAAU,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACxD,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,6BAAa,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YAE7E,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,UAAU,CAAC,YAAY,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YAClD,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACtC,UAAU,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,yBAAyB,CAAC,IAAe,EAAE,QAAgB,EAAE,KAAgB;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzC,SAAS,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACpC,SAAS,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,UAAU,CAAC,eAAe,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC;YACrD,SAAS,CAAC,YAAY,EAAE,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,6BAAa,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1D,SAAS,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YACnC,UAAU,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,CAAC,EAAU;QAClB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,qBAAqB,CAAC,IAAe,EAAE,SAA4B,EAAE,UAA2B;QAC9F,IAAI,UAAU,YAAY,6BAAa,EAAE,CAAC;YACxC,IAAI,SAAS,YAAY,mCAAgB,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,SAA6B,CAAC;gBACzC,IAAI,CAAC,sBAAsB,CAAC,EAAE,CAAC,gCAAgC,EAAE,EAAE,UAAU,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,IAAe,EAAE,SAA4B,EAAE,UAA2B;;QAC5F,IAAI,UAAU,YAAY,6BAAa,EAAE,CAAC;YACxC,IAAI,SAAS,YAAY,mCAAgB,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,SAA6B,CAAC;gBACzC,IAAI,CAAC,sBAAsB,CAAC,MAAA,MAAA,EAAE,CAAC,eAAe,EAAE,0CAAE,aAAa,EAAE,0CAAE,OAAO,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;CAGF;AArLD,sBAqLC"}

package/dist/data-structures/graph/nodes/GraphNode.d.ts

@@ -1,6 +1,6 @@
-import { GraphObject } from '../GraphObject.js';
-import { IIdentifiedObject } from '../../../interfaces/model/core/IIdentifiedObject.js';
-export declare class GraphNode extends GraphObject {
-    constructor(id: string, name: string, data: IIdentifiedObject);
-    canPassThrough(): boolean;
-}
+import { GraphObject } from '../GraphObject.js';
+import { IIdentifiedObject } from '../../../interfaces/model/core/IIdentifiedObject.js';
+export declare class GraphNode extends GraphObject {
+    constructor(id: string, name: string, data: IIdentifiedObject);
+    canPassThrough(): boolean;
+}

package/dist/data-structures/graph/nodes/GraphNode.js

@@ -1,15 +1,15 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphNode = void 0;
-const GraphObject_1 = require("../GraphObject.js");
-class GraphNode extends GraphObject_1.GraphObject {
-    constructor(id, name, data) {
-        super(id, name, data);
-        this.inService = true;
-    }
-    canPassThrough() {
-        return this.inService;
-    }
-}
-exports.GraphNode = GraphNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphNode = void 0;
+const GraphObject_1 = require("../GraphObject.js");
+class GraphNode extends GraphObject_1.GraphObject {
+    constructor(id, name, data) {
+        super(id, name, data);
+        this.inService = true;
+    }
+    canPassThrough() {
+        return this.inService;
+    }
+}
+exports.GraphNode = GraphNode;
 //# sourceMappingURL=GraphNode.js.map

package/dist/data-structures/tree/GraphTree.d.ts

@@ -1,26 +1,26 @@
-import { GraphTreeNode } from './GraphTreeNode.js';
-import { GraphTreeEdge } from './GraphTreeEdge.js';
-import { GraphTreeObject } from './GraphTreeObject.js';
-import { ITreeNode } from './tree-interfaces.js';
-export declare class GraphTree {
-    rootNode: GraphTreeNode;
-    treeNodes: GraphTreeNode[];
-    treeEdges: GraphTreeEdge[];
-    treeObjects: Map<string, GraphTreeObject>;
-    /*** Aggriegierte Knoten wie z.B. Substation, VoltageLevel */
-    compoundNodes: Map<string, GraphTreeNode>;
-    /*** Aggriegierte Kanten wie z.B. parallele Leitungen */
-    compoundEdges: Map<string, GraphTreeEdge>;
-    addNode(node: GraphTreeNode): void;
-    addEdge(edge: GraphTreeEdge): void;
-    addTreeObject(object: GraphTreeObject): void;
-    getTreeObject(id: string): GraphTreeObject | undefined;
-    getNode(id: string): GraphTreeNode | undefined;
-    getEdge(id: string): GraphTreeEdge | undefined;
-    setRootNode(node: GraphTreeNode): void;
-    toJSON(nodes: GraphTreeNode[]): ITreeNode[];
-    addCompoundNodeElement(compoundID: string, treeObject: GraphTreeObject): void;
-    private getCompoundElement;
-    makeCompoundParentChildAssociatons(): void;
-    purge(): void;
-}
+import { GraphTreeNode } from './GraphTreeNode.js';
+import { GraphTreeEdge } from './GraphTreeEdge.js';
+import { GraphTreeObject } from './GraphTreeObject.js';
+import { ITreeNode } from './tree-interfaces.js';
+export declare class GraphTree {
+    rootNode: GraphTreeNode;
+    treeNodes: GraphTreeNode[];
+    treeEdges: GraphTreeEdge[];
+    treeObjects: Map<string, GraphTreeObject>;
+    /*** Aggriegierte Knoten wie z.B. Substation, VoltageLevel */
+    compoundNodes: Map<string, GraphTreeNode>;
+    /*** Aggriegierte Kanten wie z.B. parallele Leitungen */
+    compoundEdges: Map<string, GraphTreeEdge>;
+    addNode(node: GraphTreeNode): void;
+    addEdge(edge: GraphTreeEdge): void;
+    addTreeObject(object: GraphTreeObject): void;
+    getTreeObject(id: string): GraphTreeObject | undefined;
+    getNode(id: string): GraphTreeNode | undefined;
+    getEdge(id: string): GraphTreeEdge | undefined;
+    setRootNode(node: GraphTreeNode): void;
+    toJSON(nodes: GraphTreeNode[]): ITreeNode[];
+    addCompoundNodeElement(compoundID: string, treeObject: GraphTreeObject): void;
+    private getCompoundElement;
+    makeCompoundParentChildAssociatons(): void;
+    purge(): void;
+}