@deck.gl-community/graph-layers 9.2.0-beta.2 → 9.2.0-beta.3

package/dist/graph/classic-graph.d.ts

@@ -0,0 +1,169 @@
+import { Edge } from './edge';
+import { Node } from './node';
+import type { EdgeInterface, NodeInterface, GraphProps } from './graph';
+import { Graph } from './graph';
+import type { PlainGraphData } from '../graph-data/graph-data';
+export type ClassicGraphProps = GraphProps & {
+    data: PlainGraphData;
+};
+/** Basic graph data structure */
+export declare class ClassicGraph extends Graph {
+    /** List object of nodes. */
+    private _nodeMap;
+    /** List of object edges. */
+    private _edgeMap;
+    /**
+     * Identifies whether performing dirty check when streaming new data. If
+     * the name of the graph is not specified, will fall back to current time stamp.
+     */
+    private _name;
+    /** Version the graph. A version is a number that is incremented every time the graph is updated. */
+    version: number;
+    /** Cached data: create array data from maps. */
+    private _cache;
+    private _suspendVersionUpdates;
+    /**
+     * The constructor of the graph class.
+     * @param props -
+     */
+    constructor(props: ClassicGraphProps);
+    /**
+     * Set graph name
+     * @param name
+     */
+    setGraphName(name: string): void;
+    /** Get the name of the graph. Default value is the time stamp when creating this graph.
+     * @return graph name.
+     */
+    getGraphName(): string;
+    /**
+     * Perform a batch of operations defined by cb before indicating graph is updated
+     * @param {function} cb - a callback function containing the operations to perform
+     */
+    transaction<T>(cb: (...args: unknown[]) => T): T;
+    /**
+     * Add a new node to the graph.
+     * @paramnode - expect a Node object to be added to the graph.
+     */
+    addNode(node: Node): void;
+    /**
+     * Batch add nodes to the graph.
+     * @param nodes - a list of nodes to be added.
+     */
+    batchAddNodes(nodes: Node[]): void;
+    /**
+     * Get all the nodes of the graph.
+     * @return {Node[]} - get all the nodes in the graph.
+     */
+    getNodes(): NodeInterface[];
+    /**
+     * Get the node map of the graph. The key of the map is the ID of the nodes.
+     * @return - a map of nodes keyed by node IDs.
+     */
+    getNodeMap(): Record<string | number, Node>;
+    /**
+     * Find a node by id
+     * @param nodeId The id of the node
+     * @return  Node
+     */
+    findNode(nodeId: string | number): Node | undefined;
+    findNodeById(nodeId: string | number): NodeInterface | undefined;
+    /**
+     * Update the indicated node to the provided value
+     * @param node
+     */
+    updateNode(node: Node): void;
+    /**
+     * Add a new edge to the graph.
+     * @param edge - expect a Edge object to be added to the graph.
+     */
+    addEdge(edge: Edge): void;
+    /**
+     * Batch add edges to the graph
+     * @param edges - a list of edges to be added.
+     */
+    batchAddEdges(edges: Edge[]): void;
+    /**
+     * Update the indicated edge to the provided value
+     * @param edge
+     */
+    updateEdge(edge: Edge): void;
+    /**
+     * Remove a node from the graph by node ID
+     * @param nodeId - the ID of the target node.
+     */
+    removeNode(nodeId: string | number): void;
+    /**
+     * Get all the edges of the graph.
+     * @return get all the edges in the graph.
+     */
+    getEdges(): EdgeInterface[];
+    destroy(): void;
+    /**
+     * Get the edge map of the graph. The key of the map is the ID of the edges.
+     * @return - a map of edges keyed by edge IDs.
+     */
+    getEdgeMap(): Record<string, Edge>;
+    /**
+     * Remove an edge from the graph by the edge ID
+     * @param  {String|Number} edgeId - the target edge ID.
+     */
+    removeEdge(edgeId: string | number): void;
+    /**
+     * Find the edge by edge ID.
+     * @param id - the target edge ID
+     * @return - the target edge.
+     */
+    findEdge(edgeId: string | number): Edge;
+    /**
+     * Return all the connected edges of a node by nodeID.
+     * @param  nodeId - the target node ID
+     * @return - an array of the connected edges.
+     */
+    getConnectedEdges(nodeId: string | number): EdgeInterface[];
+    /**
+     * Return all the sibling nodes of a node by nodeID.
+     * @param nodeId - the target node ID
+     * @return - an array of the sibling nodes.
+     */
+    getNodeSiblings(nodeId: string | number): Node[];
+    /**
+     * Get the degree of a node.
+     * @param nodeId - the target node ID.
+     * @return - the degree of the node.
+     */
+    getDegree(nodeId: string | number): number;
+    /**
+     * Clean up all the nodes in the graph.
+     */
+    resetNodes(): void;
+    /**
+     * Clean up all the edges in the graph.
+     */
+    resetEdges(): void;
+    /**
+     * Clean up everything in the graph.
+     */
+    reset(): void;
+    /**
+     * @deprecated Prefer interacting with this instance directly.
+     */
+    getClassicGraph(): ClassicGraph;
+    /**
+     * Trigger an update to the graph.
+     */
+    triggerUpdate(): void;
+    /**
+     * Return true if the graph is empty.
+     * @return {Boolean} Return true if the graph is empty.
+     */
+    isEmpty(): boolean;
+    /**
+     * Check the equality of two graphs data by checking last update time stamp
+     * @param graph Another graph to be compared against itself
+     * @return true if the graph is the same as itself.
+     */
+    equals(graph: ClassicGraph): boolean;
+    _bumpVersion(): void;
+    _updateCache(key: 'nodes' | 'edges', updateValue: unknown): void;
+}

package/dist/graph/classic-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classic-graph.d.ts","sourceRoot":"","sources":["../../src/graph/classic-graph.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,IAAI,EAAC,kBAAe;AAC5B,OAAO,EAAC,IAAI,EAAC,kBAAe;AAC5B,OAAO,KAAK,EAAC,aAAa,EAAE,aAAa,EAAE,UAAU,EAAC,mBAAgB;AACtE,OAAO,EAAC,KAAK,EAAC,mBAAgB;AAC9B,OAAO,KAAK,EAAC,cAAc,EAA+B,oCAAiC;AAG3F,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG;IAC3C,IAAI,EAAE,cAAc,CAAC;CACtB,CAAC;AAEF,iCAAiC;AACjC,qBAAa,YAAa,SAAQ,KAAK;IACrC,4BAA4B;IAC5B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,4BAA4B;IAC5B,OAAO,CAAC,QAAQ,CAA4B;IAE5C;;;OAGG;IACH,OAAO,CAAC,KAAK,CAAiC;IAC9C,oGAAoG;IAC7F,OAAO,SAAK;IACnB,gDAAgD;IAChD,OAAO,CAAC,MAAM,CAAmD;IACjE,OAAO,CAAC,sBAAsB,CAAS;IAEvC;;;OAGG;gBACS,KAAK,EAAE,iBAAiB;IAkBpC;;;OAGG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIhC;;OAEG;IACH,YAAY,IAAI,MAAM;IAItB;;;OAGG;IACH,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC;IAShD;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAQzB;;;OAGG;IACH,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;IAalC;;;OAGG;IACH,QAAQ,IAAI,aAAa,EAAE;IAM3B;;;OAGG;IACH,UAAU,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,CAAC;IAI3C;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS;IAInD,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,SAAS;IAIhE;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAM5B;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAgBzB;;;OAGG;IACH,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI;IAKlC;;;OAGG;IACH,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAM5B;;;OAGG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAgBzC;;;OAGG;IACH,QAAQ,IAAI,aAAa,EAAE;IAM3B,OAAO,IAAI,IAAI;IAIf;;;OAGG;IACH,UAAU,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC;IAIlC;;;OAGG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAgBzC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAIvC;;;;OAIG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,aAAa,EAAE;IAS3D;;;;OAIG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,EAAE;IAShD;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAS1C;;OAEG;IACH,UAAU,IAAI,IAAI;IAKlB;;OAEG;IACH,UAAU,IAAI,IAAI;IAKlB;;OAEG;IACH,KAAK,IAAI,IAAI;IAMb;;OAEG;IACH,eAAe,IAAI,YAAY;IAI/B;;OAEG;IACH,aAAa,IAAI,IAAI;IAIrB;;;OAGG;IACH,OAAO,IAAI,OAAO;IAIlB;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO;IAOpC,YAAY,IAAI,IAAI;IAOpB,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,EAAE,WAAW,EAAE,OAAO,GAAG,IAAI;CAGjE"}

package/dist/graph/classic-graph.js

@@ -0,0 +1,390 @@
+// deck.gl-community
+// SPDX-License-Identifier: MIT
+// Copyright (c) vis.gl contributors
+import { warn } from '../utils/log';
+import { Cache } from '../core/cache';
+import { Edge } from './edge';
+import { Node } from './node';
+import { Graph } from './graph';
+import { cloneRecord, normalizeEdgeState, normalizeNodeState, normalizeVersion } from './graph-normalization';
+/** Basic graph data structure */
+export class ClassicGraph extends Graph {
+    /** List object of nodes. */
+    _nodeMap = {};
+    /** List of object edges. */
+    _edgeMap = {};
+    /**
+     * Identifies whether performing dirty check when streaming new data. If
+     * the name of the graph is not specified, will fall back to current time stamp.
+     */
+    _name = Date.now().toString();
+    /** Version the graph. A version is a number that is incremented every time the graph is updated. */
+    version = 0;
+    /** Cached data: create array data from maps. */
+    _cache = new Cache();
+    _suspendVersionUpdates = false;
+    /**
+     * The constructor of the graph class.
+     * @param props -
+     */
+    constructor(props) {
+        super(props);
+        const data = props.data;
+        const nodes = createNodesFromPlainGraphData(data?.nodes);
+        const edges = createEdgesFromPlainGraphData(data?.edges);
+        this._name = `unnamed-graph-${Date.now().toString()}`;
+        this._suspendVersionUpdates = true;
+        this.version = normalizeVersion(data?.version);
+        try {
+            this.batchAddNodes(nodes);
+            this.batchAddEdges(edges);
+        }
+        finally {
+            this._suspendVersionUpdates = false;
+        }
+    }
+    /**
+     * Set graph name
+     * @param name
+     */
+    setGraphName(name) {
+        this._name = name;
+    }
+    /** Get the name of the graph. Default value is the time stamp when creating this graph.
+     * @return graph name.
+     */
+    getGraphName() {
+        return this._name.toString();
+    }
+    /**
+     * Perform a batch of operations defined by cb before indicating graph is updated
+     * @param {function} cb - a callback function containing the operations to perform
+     */
+    transaction(cb) {
+        try {
+            this.props.onTransactionStart?.();
+            return cb();
+        }
+        finally {
+            this.props.onTransactionEnd?.();
+        }
+    }
+    /**
+     * Add a new node to the graph.
+     * @paramnode - expect a Node object to be added to the graph.
+     */
+    addNode(node) {
+        // add it to the list and map
+        this._nodeMap[node.getId()] = node;
+        // update last update time stamp
+        this._bumpVersion();
+        this.props.onNodeAdded?.(node);
+    }
+    /**
+     * Batch add nodes to the graph.
+     * @param nodes - a list of nodes to be added.
+     */
+    batchAddNodes(nodes) {
+        // convert an array of objects to an object
+        this._nodeMap = nodes.reduce((res, node) => {
+            res[node.getId()] = node;
+            this.props.onNodeAdded?.(node);
+            return res;
+        }, { ...this._nodeMap });
+        this._bumpVersion();
+    }
+    /**
+     * Get all the nodes of the graph.
+     * @return {Node[]} - get all the nodes in the graph.
+     */
+    getNodes() {
+        this._updateCache('nodes', () => Object.values(this._nodeMap));
+        return this._cache.get('nodes') ?? [];
+    }
+    /**
+     * Get the node map of the graph. The key of the map is the ID of the nodes.
+     * @return - a map of nodes keyed by node IDs.
+     */
+    getNodeMap() {
+        return this._nodeMap;
+    }
+    /**
+     * Find a node by id
+     * @param nodeId The id of the node
+     * @return  Node
+     */
+    findNode(nodeId) {
+        return this._nodeMap[nodeId];
+    }
+    findNodeById(nodeId) {
+        return this.findNode(nodeId);
+    }
+    /**
+     * Update the indicated node to the provided value
+     * @param node
+     */
+    updateNode(node) {
+        this._nodeMap[node.getId()] = node;
+        this._bumpVersion();
+        this.props.onNodeUpdated?.(node);
+    }
+    /**
+     * Add a new edge to the graph.
+     * @param edge - expect a Edge object to be added to the graph.
+     */
+    addEdge(edge) {
+        const sourceNode = this.findNode(edge.getSourceNodeId());
+        const targetNode = this.findNode(edge.getTargetNodeId());
+        if (!sourceNode || !targetNode) {
+            warn(`Unable to add edge ${edge.id},  source or target node is missing.`);
+            return;
+        }
+        this._edgeMap[edge.getId()] = edge;
+        sourceNode.addConnectedEdges(edge);
+        targetNode.addConnectedEdges(edge);
+        this._bumpVersion();
+        this.props.onEdgeAdded?.(edge);
+    }
+    /**
+     * Batch add edges to the graph
+     * @param edges - a list of edges to be added.
+     */
+    batchAddEdges(edges) {
+        edges.forEach((edge) => this.addEdge(edge));
+        this._bumpVersion();
+    }
+    /**
+     * Update the indicated edge to the provided value
+     * @param edge
+     */
+    updateEdge(edge) {
+        this._edgeMap[edge.getId()] = edge;
+        this._bumpVersion();
+        this.props.onEdgeUpdated?.(edge);
+    }
+    /**
+     * Remove a node from the graph by node ID
+     * @param nodeId - the ID of the target node.
+     */
+    removeNode(nodeId) {
+        const node = this.findNode(nodeId);
+        if (!node) {
+            warn(`Unable to remove node ${nodeId} - doesn't exist`);
+            return;
+        }
+        // remove all edges connect to this node from map
+        node.getConnectedEdges().forEach((e) => {
+            delete this._edgeMap[e.getId()];
+        });
+        // remove the node from map
+        delete this._nodeMap[nodeId];
+        this._bumpVersion();
+        this.props.onNodeRemoved?.(node);
+    }
+    /**
+     * Get all the edges of the graph.
+     * @return get all the edges in the graph.
+     */
+    getEdges() {
+        this._updateCache('edges', () => Object.values(this._edgeMap));
+        return this._cache.get('edges') ?? [];
+    }
+    destroy() {
+        // No additional teardown required for the legacy graph implementation.
+    }
+    /**
+     * Get the edge map of the graph. The key of the map is the ID of the edges.
+     * @return - a map of edges keyed by edge IDs.
+     */
+    getEdgeMap() {
+        return this._edgeMap;
+    }
+    /**
+     * Remove an edge from the graph by the edge ID
+     * @param  {String|Number} edgeId - the target edge ID.
+     */
+    removeEdge(edgeId) {
+        const edge = this.findEdge(edgeId);
+        if (!edge) {
+            warn(`Unable to remove edge ${edgeId} - doesn't exist`);
+            return;
+        }
+        const sourceNode = this.findNode(edge.getSourceNodeId());
+        const targetNode = this.findNode(edge.getTargetNodeId());
+        delete this._edgeMap[edgeId];
+        sourceNode.removeConnectedEdges(edge);
+        targetNode.removeConnectedEdges(edge);
+        this._bumpVersion();
+        this.props.onEdgeRemoved?.(edge);
+    }
+    /**
+     * Find the edge by edge ID.
+     * @param id - the target edge ID
+     * @return - the target edge.
+     */
+    findEdge(edgeId) {
+        return this._edgeMap[edgeId];
+    }
+    /**
+     * Return all the connected edges of a node by nodeID.
+     * @param  nodeId - the target node ID
+     * @return - an array of the connected edges.
+     */
+    getConnectedEdges(nodeId) {
+        const node = this.findNode(nodeId);
+        if (!node) {
+            warn(`Unable to find node ${nodeId} - doesn't exist`);
+            return [];
+        }
+        return node.getConnectedEdges();
+    }
+    /**
+     * Return all the sibling nodes of a node by nodeID.
+     * @param nodeId - the target node ID
+     * @return - an array of the sibling nodes.
+     */
+    getNodeSiblings(nodeId) {
+        const node = this.findNode(nodeId);
+        if (!node) {
+            warn(`Unable to find node ${nodeId} - doesn't exist`);
+            return [];
+        }
+        return node.getSiblingIds().map((siblingNodeId) => this.findNode(siblingNodeId));
+    }
+    /**
+     * Get the degree of a node.
+     * @param nodeId - the target node ID.
+     * @return - the degree of the node.
+     */
+    getDegree(nodeId) {
+        const node = this.findNode(nodeId);
+        if (!node) {
+            warn(`Unable to find node ${nodeId} - doesn't exist`);
+            return 0;
+        }
+        return node.getDegree();
+    }
+    /**
+     * Clean up all the nodes in the graph.
+     */
+    resetNodes() {
+        this._nodeMap = {};
+        this._bumpVersion();
+    }
+    /**
+     * Clean up all the edges in the graph.
+     */
+    resetEdges() {
+        this._edgeMap = {};
+        this._bumpVersion();
+    }
+    /**
+     * Clean up everything in the graph.
+     */
+    reset() {
+        this.resetNodes();
+        this.resetEdges();
+        this._bumpVersion();
+    }
+    /**
+     * @deprecated Prefer interacting with this instance directly.
+     */
+    getClassicGraph() {
+        return this;
+    }
+    /**
+     * Trigger an update to the graph.
+     */
+    triggerUpdate() {
+        this._bumpVersion();
+    }
+    /**
+     * Return true if the graph is empty.
+     * @return {Boolean} Return true if the graph is empty.
+     */
+    isEmpty() {
+        return Object.keys(this._nodeMap).length === 0;
+    }
+    /**
+     * Check the equality of two graphs data by checking last update time stamp
+     * @param graph Another graph to be compared against itself
+     * @return true if the graph is the same as itself.
+     */
+    equals(graph) {
+        if (!graph || !(graph instanceof ClassicGraph)) {
+            return false;
+        }
+        return this.version === graph.version;
+    }
+    _bumpVersion() {
+        if (this._suspendVersionUpdates) {
+            return;
+        }
+        this.version += 1;
+    }
+    _updateCache(key, updateValue) {
+        this._cache.set(key, updateValue, this.version);
+    }
+}
+function createNodesFromPlainGraphData(nodes) {
+    if (!nodes) {
+        return [];
+    }
+    return nodes.map((nodeData) => {
+        const nodeAttributes = createNodeAttributesFromPlainData(nodeData);
+        const selectable = typeof nodeData.selectable === 'boolean'
+            ? nodeData.selectable
+            : Boolean(nodeAttributes.selectable);
+        const highlightConnectedEdges = typeof nodeData.highlightConnectedEdges === 'boolean'
+            ? nodeData.highlightConnectedEdges
+            : Boolean(nodeAttributes.highlightConnectedEdges);
+        const node = new Node({
+            id: nodeData.id,
+            selectable,
+            highlightConnectedEdges,
+            data: nodeAttributes
+        });
+        node.setState(normalizeNodeState(nodeData.state));
+        return node;
+    });
+}
+function createEdgesFromPlainGraphData(edges) {
+    if (!edges) {
+        return [];
+    }
+    return edges.map((edgeData) => {
+        const edgeAttributes = createEdgeAttributesFromPlainData(edgeData);
+        const directed = typeof edgeData.directed === 'boolean'
+            ? edgeData.directed
+            : Boolean(edgeAttributes.directed);
+        const edge = new Edge({
+            id: edgeData.id,
+            sourceId: edgeData.sourceId,
+            targetId: edgeData.targetId,
+            directed,
+            data: edgeAttributes
+        });
+        edge.setState(normalizeEdgeState(edgeData.state));
+        return edge;
+    });
+}
+function createNodeAttributesFromPlainData(node) {
+    const attributes = cloneRecord(node.attributes);
+    if (typeof node.label !== 'undefined') {
+        attributes.label = node.label;
+    }
+    if (typeof node.weight !== 'undefined') {
+        attributes.weight = node.weight;
+    }
+    return attributes;
+}
+function createEdgeAttributesFromPlainData(edge) {
+    const attributes = cloneRecord(edge.attributes);
+    if (typeof edge.label !== 'undefined') {
+        attributes.label = edge.label;
+    }
+    if (typeof edge.weight !== 'undefined') {
+        attributes.weight = edge.weight;
+    }
+    return attributes;
+}

package/dist/graph/classic-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classic-graph.js","sourceRoot":"","sources":["../../src/graph/classic-graph.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAEpC,OAAO,EAAC,IAAI,EAAC,wBAAqB;AAClC,OAAO,EAAC,KAAK,EAAC,yBAAsB;AACpC,OAAO,EAAC,IAAI,EAAC,kBAAe;AAC5B,OAAO,EAAC,IAAI,EAAC,kBAAe;AAE5B,OAAO,EAAC,KAAK,EAAC,mBAAgB;AAE9B,OAAO,EAAC,WAAW,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,gBAAgB,EAAC,iCAA8B;AAM5G,iCAAiC;AACjC,MAAM,OAAO,YAAa,SAAQ,KAAK;IACrC,4BAA4B;IACpB,QAAQ,GAAyB,EAAE,CAAC;IAC5C,4BAA4B;IACpB,QAAQ,GAAyB,EAAE,CAAC;IAE5C;;;OAGG;IACK,KAAK,GAAW,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;IAC9C,oGAAoG;IAC7F,OAAO,GAAG,CAAC,CAAC;IACnB,gDAAgD;IACxC,MAAM,GAAG,IAAI,KAAK,EAAsC,CAAC;IACzD,sBAAsB,GAAG,KAAK,CAAC;IAEvC;;;OAGG;IACH,YAAY,KAAwB;QAClC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEb,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACxB,MAAM,KAAK,GAAG,6BAA6B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,6BAA6B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAEzD,IAAI,CAAC,KAAK,GAAG,iBAAiB,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC;QACtD,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/C,IAAI,CAAC;YACH,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,sBAAsB,GAAG,KAAK,CAAC;QACtC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,IAAY;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,WAAW,CAAI,EAA6B;QAC1C,IAAI,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAAE,CAAC;YAClC,OAAO,EAAE,EAAE,CAAC;QACd,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,KAAK,CAAC,gBAAgB,EAAE,EAAE,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAU;QAChB,6BAA6B;QAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACnC,gCAAgC;QAChC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,KAAa;QACzB,2CAA2C;QAC3C,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAC1B,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YACZ,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC;YAC/B,OAAO,GAAG,CAAC;QACb,CAAC,EACD,EAAC,GAAG,IAAI,CAAC,QAAQ,EAAC,CACnB,CAAC;QACF,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE/D,OAAQ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAY,IAAI,EAAE,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAuB;QAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,YAAY,CAAC,MAAuB;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,IAAU;QACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACnC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAU;QAChB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAEzD,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/B,IAAI,CAAC,sBAAsB,IAAI,CAAC,EAAE,sCAAsC,CAAC,CAAC;YAC1E,OAAO;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACnC,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACnC,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,KAAa;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,IAAU;QACnB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QACnC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAuB;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,yBAAyB,MAAM,kBAAkB,CAAC,CAAC;YACxD,OAAO;QACT,CAAC;QACD,iDAAiD;QACjD,IAAI,CAAC,iBAAiB,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACrC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,2BAA2B;QAC3B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAE/D,OAAQ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAY,IAAI,EAAE,CAAC;IACpD,CAAC;IAED,OAAO;QACL,uEAAuE;IACzE,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,MAAuB;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,yBAAyB,MAAM,kBAAkB,CAAC,CAAC;YACxD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAEzD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,UAAU,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACtC,UAAU,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,MAAuB;QAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CAAC,MAAuB;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,uBAAuB,MAAM,kBAAkB,CAAC,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,MAAuB;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,uBAAuB,MAAM,kBAAkB,CAAC,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC;IACnF,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAuB;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,uBAAuB,MAAM,kBAAkB,CAAC,CAAC;YACtD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,aAAa;QACX,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAmB;QACxB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,YAAY,YAAY,CAAC,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC;IACxC,CAAC;IAED,YAAY;QACV,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAChC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,YAAY,CAAC,GAAsB,EAAE,WAAoB;QACvD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,WAAkB,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC;CACF;AAED,SAAS,6BAA6B,CAAC,KAA8B;IACnE,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC5B,MAAM,cAAc,GAAG,iCAAiC,CAAC,QAAQ,CAAC,CAAC;QACnE,MAAM,UAAU,GACd,OAAO,QAAQ,CAAC,UAAU,KAAK,SAAS;YACtC,CAAC,CAAC,QAAQ,CAAC,UAAU;YACrB,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QACzC,MAAM,uBAAuB,GAC3B,OAAO,QAAQ,CAAC,uBAAuB,KAAK,SAAS;YACnD,CAAC,CAAC,QAAQ,CAAC,uBAAuB;YAClC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,uBAAuB,CAAC,CAAC;QAEtD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC;YACpB,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,UAAU;YACV,uBAAuB;YACvB,IAAI,EAAE,cAAc;SACrB,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,6BAA6B,CAAC,KAA8B;IACnE,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC5B,MAAM,cAAc,GAAG,iCAAiC,CAAC,QAAQ,CAAC,CAAC;QACnE,MAAM,QAAQ,GACZ,OAAO,QAAQ,CAAC,QAAQ,KAAK,SAAS;YACpC,CAAC,CAAC,QAAQ,CAAC,QAAQ;YACnB,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC;YACpB,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,QAAQ;YACR,IAAI,EAAE,cAAc;SACrB,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,iCAAiC,CAAC,IAAmB;IAC5D,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChD,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;QACtC,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QACvC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAClC,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,iCAAiC,CAAC,IAAmB;IAC5D,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChD,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;QACtC,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;QACvC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAClC,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/graph/edge.d.ts

@@ -1,5 +1,5 @@
 import type { EdgeState } from '../core/constants';
-import { Node } from './node';
+import type { EdgeInterface, NodeInterface } from './graph';
 export interface EdgeOptions {
     /** the unique ID of the edge */
     id: string | number;
@@ -13,9 +13,9 @@ export interface EdgeOptions {
     data?: Record<string, unknown>;
 }
 /** Basic edge data structure */
-export declare class Edge {
+export declare class Edge implements EdgeInterface {
     /** Unique uuid of the edge. */
-    id: string | number;
+    readonly id: string | number;
     /** ID of the source node. */
     private _sourceId;
     /** ID of the target node. */
@@ -82,7 +82,7 @@ export declare class Edge {
      * @returns state - the current interaction state for the edge
      */
     getState(): EdgeState;
-    addNode(node: Node): void;
-    removeNode(node: Node): void;
-    getConnectedNodes(): Node[];
+    addNode(node: NodeInterface): void;
+    removeNode(node: NodeInterface): void;
+    getConnectedNodes(): NodeInterface[];
 }

package/dist/graph/edge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/graph/edge.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAC,SAAS,EAAC,6BAA0B;AACjD,OAAO,EAAC,IAAI,EAAC,kBAAe;AAE5B,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IACpB,gCAAgC;IAChC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1B,gCAAgC;IAChC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1B,0CAA0C;IAC1C,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,4BAA4B;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED,gCAAgC;AAChC,qBAAa,IAAI;IACf,+BAA+B;IACxB,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3B,6BAA6B;IAC7B,OAAO,CAAC,SAAS,CAAkB;IACnC,6BAA6B;IAC7B,OAAO,CAAC,SAAS,CAAkB;IACnC,2CAA2C;IAC3C,OAAO,CAAC,SAAS,CAAU;IAC3B,yCAAyC;IACzC,OAAO,CAAC,KAAK,CAA0B;IACvC,gEAAgE;IAChE,SAAgB,MAAM,QAAQ;IAC9B,wCAAwC;IACxC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA4B;IAC5D,kBAAkB;IACX,KAAK,EAAE,SAAS,CAAa;IAEpC;;;OAGG;gBACS,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAgB,EAAC,EAAE,WAAW;IAQzE;;;OAGG;IACH,KAAK,IAAI,MAAM,GAAG,MAAM;IAIxB;;;OAGG;IACH,UAAU,IAAI,OAAO;IAIrB;;;OAGG;IACH,eAAe,IAAI,MAAM,GAAG,MAAM;IAIlC;;;OAGG;IACH,eAAe,IAAI,MAAM,GAAG,MAAM;IAIlC;;;;OAIG;IACH,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAatC;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAI5C;;;;OAIG;IACH,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAIlD;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAIhC;;;OAGG;IACH,QAAQ,IAAI,SAAS;IAIrB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAIzB,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAI5B,iBAAiB,IAAI,IAAI,EAAE;CAG5B"}
+{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/graph/edge.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAC,SAAS,EAAC,6BAA0B;AACjD,OAAO,KAAK,EAAC,aAAa,EAAE,aAAa,EAAC,mBAAgB;AAE1D,MAAM,WAAW,WAAW;IAC1B,gCAAgC;IAChC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IACpB,gCAAgC;IAChC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1B,gCAAgC;IAChC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1B,0CAA0C;IAC1C,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,4BAA4B;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED,gCAAgC;AAChC,qBAAa,IAAK,YAAW,aAAa;IACxC,+BAA+B;IAC/B,SAAgB,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,6BAA6B;IAC7B,OAAO,CAAC,SAAS,CAAkB;IACnC,6BAA6B;IAC7B,OAAO,CAAC,SAAS,CAAkB;IACnC,2CAA2C;IAC3C,OAAO,CAAC,SAAS,CAAU;IAC3B,yCAAyC;IACzC,OAAO,CAAC,KAAK,CAA0B;IACvC,gEAAgE;IAChE,SAAgB,MAAM,QAAQ;IAC9B,wCAAwC;IACxC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAqC;IACrE,kBAAkB;IACX,KAAK,EAAE,SAAS,CAAa;IAEpC;;;OAGG;gBACS,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAgB,EAAC,EAAE,WAAW;IAQzE;;;OAGG;IACH,KAAK,IAAI,MAAM,GAAG,MAAM;IAIxB;;;OAGG;IACH,UAAU,IAAI,OAAO;IAIrB;;;OAGG;IACH,eAAe,IAAI,MAAM,GAAG,MAAM;IAIlC;;;OAGG;IACH,eAAe,IAAI,MAAM,GAAG,MAAM;IAIlC;;;;OAIG;IACH,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAatC;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAI5C;;;;OAIG;IACH,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAIlD;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAIhC;;;OAGG;IACH,QAAQ,IAAI,SAAS;IAIrB,OAAO,CAAC,IAAI,EAAE,aAAa,GAAG,IAAI;IAIlC,UAAU,CAAC,IAAI,EAAE,aAAa,GAAG,IAAI;IAIrC,iBAAiB,IAAI,aAAa,EAAE;CAGrC"}

package/dist/graph/edge.js.map

@@ -1 +1 @@
-{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/graph/edge.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAmBpC,gCAAgC;AAChC,MAAM,OAAO,IAAI;IACf,+BAA+B;IACxB,EAAE,CAAkB;IAC3B,6BAA6B;IACrB,SAAS,CAAkB;IACnC,6BAA6B;IACrB,SAAS,CAAkB;IACnC,2CAA2C;IACnC,SAAS,CAAU;IAC3B,yCAAyC;IACjC,KAAK,CAA0B;IACvC,gEAAgE;IAChD,MAAM,GAAG,IAAI,CAAC;IAC9B,wCAAwC;IACvB,eAAe,GAAyB,EAAE,CAAC;IAC5D,kBAAkB;IACX,KAAK,GAAc,SAAS,CAAC;IAEpC;;;OAGG;IACH,YAAY,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,KAAK,EAAc;QACvE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,GAAW;QAC1B,2CAA2C;QAC3C,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,uDAAuD;aAClD,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QACD,uBAAuB;QACvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAA6B;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,GAAW,EAAE,KAAc;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,KAAgB;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,IAAU;QAChB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5C,CAAC;IAED,UAAU,CAAC,IAAU;QACnB,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,iBAAiB;QACf,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC7C,CAAC;CACF"}
+{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/graph/edge.ts"],"names":[],"mappings":"AAAA,oBAAoB;AACpB,+BAA+B;AAC/B,oCAAoC;AAmBpC,gCAAgC;AAChC,MAAM,OAAO,IAAI;IACf,+BAA+B;IACf,EAAE,CAAkB;IACpC,6BAA6B;IACrB,SAAS,CAAkB;IACnC,6BAA6B;IACrB,SAAS,CAAkB;IACnC,2CAA2C;IACnC,SAAS,CAAU;IAC3B,yCAAyC;IACjC,KAAK,CAA0B;IACvC,gEAAgE;IAChD,MAAM,GAAG,IAAI,CAAC;IAC9B,wCAAwC;IACvB,eAAe,GAAkC,EAAE,CAAC;IACrE,kBAAkB;IACX,KAAK,GAAc,SAAS,CAAC;IAEpC;;;OAGG;IACH,YAAY,EAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,KAAK,EAAc;QACvE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,GAAW;QAC1B,2CAA2C;QAC3C,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,uDAAuD;aAClD,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QACD,uBAAuB;QACvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAA6B;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,GAAW,EAAE,KAAc;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,KAAgB;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,IAAmB;QACzB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5C,CAAC;IAED,UAAU,CAAC,IAAmB;QAC5B,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,iBAAiB;QACf,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC7C,CAAC;CACF"}

package/dist/graph/functions/arrow-utils.d.ts

@@ -0,0 +1,6 @@
+import * as arrow from 'apache-arrow';
+export declare function getVectorLength(vector: arrow.Vector | null): number;
+export declare function getVectorValue(vector: arrow.Vector | null, index: number): unknown;
+export declare function getColumnVector(table: arrow.Table, columnName: string): arrow.Vector | null;
+export declare function parseDataRecord(value: unknown): Record<string, unknown>;
+export declare function coerceIdentifier(value: unknown): string | number;

package/dist/graph/functions/arrow-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrow-utils.d.ts","sourceRoot":"","sources":["../../../src/graph/functions/arrow-utils.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC;AAEtC,wBAAgB,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,GAAG,MAAM,CAEnE;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAElF;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAqB3F;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAcvE;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,MAAM,CAkBhE"}