@pega/cosmos-react-build 9.0.0-build.9.9 → 9.0.0

package/lib/components/FlowModeller/Renderer/Utils/GraphLayout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphLayout.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphLayout.ts"],"names":[],"mappings":"AAAA,0CAA0C;AAE1C,OAAO,KAAK,MAAM,gBAAgB,CAAC;AA2BnC,MAAM,CAAC,MAAM,oBAAoB,GAAG;IAClC,WAAW,EAAE,IAAI;IACjB,WAAW,EAAE,IAAI;CAClB,CAAC;AAKF,MAAM,mBAAmB,GAAG,IAAI,CAAC;AACjC,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAElC,MAAM,CAAC,OAAO,OAAO,WAAW;IAC9B,wBAAwB;IACxB,MAAM,CAAC,IAAI,CACT,SAAY,EACZ,WAAoB,KAAK,EACzB,YAAsC,oBAAoB,CAAC,WAAW;QAEtE,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAElE,UAAU,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3C,MAAM,gBAAgB,GAAG,GAAG,CAAC;QAC7B,MAAM,iBAAiB,GAAG,GAAG,CAAC;QAE9B,UAAU,CAAC,QAAQ,CAAC;YAClB,OAAO,EAAE,SAAS;YAClB,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,EAAE,gBAAgB,GAAG,CAAC;YAC7B,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,GAAG;YACZ,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;QAEH,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC7B,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE;gBAC1B,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,IAAI,gBAAgB;gBAChD,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,iBAAiB;aACpD,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAC1C,UAAU,CAAC,OAAO,CAChB,GAAG,CAAC,UAAU,EACd,GAAG,CAAC,QAAQ,EACZ;gBACE,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,CAAC;gBACT,KAAK,EACH,GAAG,CAAC,IAAI;oBACR,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;oBAC5B,OAAO,IAAI,GAAG,CAAC,IAAI;oBACnB,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,QAAQ;oBAChC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK;oBAChB,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,GAAG,CAAC,IAAI,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;gBACjF,QAAQ,EAAE,GAAG;gBACb,WAAW,EAAE,CAAC;aACf,EACD,KAAK,CAAC,QAAQ,EAAE,CACjB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,4BAA4B,EAAE,IAAI,EAAE,CAAC,CAAC;QAEjE,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpC,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;YACjD,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YAE7E,GAAG,CAAC,WAAW,GAAG;gBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,CAAC,EAAE,IAAI,CAAC,CAAC;gBACT,CAAC,EAAE,IAAI,CAAC,CAAC;gBACT,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC;YAEF,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACvC,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAEnD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE7C,UAAU;gBACR,UAAU,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC;oBAC5B,CAAC,CAAC;wBACE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;wBACjB,CAAC,EAAE,QAAQ,CAAC,CAAC;wBACb,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;qBACpB;oBACH,CAAC,CAAC,UAAU,CAAC;YAEjB,SAAS;gBACP,SAAS,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC;oBAC/B,CAAC,CAAC;wBACE,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;wBACzB,CAAC,EAAE,MAAM,CAAC,CAAC;wBACX,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;qBAChC;oBACH,CAAC,CAAC,SAAS,CAAC;YAEhB,GAAG,CAAC,MAAM,GAAG;gBACX,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACtD,EAAE,GAAG,UAAU,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE;gBACvC,EAAE,GAAG,WAAW,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,EAAE,EAAE;gBACzC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC;gBAClC,SAAS;aACV,CAAC;YAEF,4DAA4D;YAC5D,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,4GAA4G;YAC5G,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACxB,CAAC;YAED,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAEjD,6EAA6E;YAC7E,IACE,GAAG,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC;gBACzE,MAAM,CAAC,MAAM,KAAK,CAAC,EACnB,CAAC;gBACD,GAAG,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,EAAE,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QAEtC,OAAO;YACL,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,mBAAmB;YAC3D,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,oBAAoB;SAChE,CAAC;IACJ,CAAC;CACF","sourcesContent":["// cspell:words marginx, marginy, lablepos\n\nimport dagre from '@dagrejs/dagre';\n\nimport type { ConnectorProps, GraphData, Node } from './Graph';\n\nexport interface PlottedGraphNode<T = unknown> extends Node<T> {\n  dimensions: {\n    width: number;\n    height: number;\n  };\n  position: {\n    x: number;\n    y: number;\n  };\n  referencedNode?: T;\n}\n\nexport interface PlottedGraphConnector<T = unknown> extends ConnectorProps<T> {\n  points: { x: number; y: number }[];\n  labelLayout?: {\n    value: string;\n    width: number;\n    height: number;\n    x: number;\n    y: number;\n  };\n}\n\nexport const GraphLayoutDirection = {\n  LeftToRight: 'LR',\n  TopToBottom: 'TB'\n};\n\nexport type GraphLayoutDirectionType =\n  (typeof GraphLayoutDirection)[keyof typeof GraphLayoutDirection];\n\nconst DEFAULT_GRAPH_WIDTH = 2000;\nconst DEFAULT_GRAPH_HEIGHT = 2000;\n\nexport default class GraphLayout {\n  // Using Dagre layouting\n  static plot<T extends GraphData<PlottedGraphNode, PlottedGraphConnector>>(\n    graphData: T,\n    readOnly: boolean = false,\n    direction: GraphLayoutDirectionType = GraphLayoutDirection.TopToBottom\n  ) {\n    const dagreGraph = new dagre.graphlib.Graph({ multigraph: true });\n\n    dagreGraph.setDefaultEdgeLabel(() => ({}));\n\n    const defaultNodeWidth = 280;\n    const defaultNodeHeight = 112;\n\n    dagreGraph.setGraph({\n      rankdir: direction,\n      ranksep: readOnly ? 2 : 4,\n      edgesep: defaultNodeWidth / 2,\n      nodesep: 20,\n      marginx: 200,\n      marginy: 32\n    });\n\n    graphData.nodes.forEach(node => {\n      dagreGraph.setNode(node.id, {\n        width: node.dimensions.width ?? defaultNodeWidth,\n        height: node.dimensions.height ?? defaultNodeHeight\n      });\n    });\n\n    graphData.connectors.forEach((con, index) => {\n      dagreGraph.setEdge(\n        con.fromNodeId,\n        con.toNodeId,\n        {\n          weight: 1,\n          minlen: 2,\n          label:\n            con.data &&\n            typeof con.data === 'object' &&\n            'label' in con.data &&\n            typeof con.data.label === 'string'\n              ? con.data.label\n              : '',\n          width: 250,\n          height: con.data && typeof con.data === 'object' && 'label' in con.data ? 90 : 40,\n          lablepos: 'c',\n          labeloffset: 0\n        },\n        index.toString()\n      );\n    });\n\n    dagre.layout(dagreGraph, { disableOptimalOrderHeuristic: true });\n\n    graphData.nodes.forEach(el => {\n      const node = dagreGraph.node(el.id);\n      el.position.x = node.x - el.dimensions.width / 2;\n      el.position.y = node.y - el.dimensions.height / 2;\n    });\n\n    graphData.connectors.forEach((con, index) => {\n      const edge = dagreGraph.edge(con.fromNodeId, con.toNodeId, index.toString());\n\n      con.labelLayout = {\n        value: edge.label,\n        x: edge.x,\n        y: edge.y,\n        width: edge.width,\n        height: edge.height\n      };\n\n      const lastIndex = edge.points.length - 1;\n      let firstPoint = edge.points[0];\n      const secondPoint = edge.points[1];\n      let lastPoint = edge.points[lastIndex];\n      const secondLastPoint = edge.points[lastIndex - 1];\n\n      const fromNode = dagreGraph.node(con.fromNodeId);\n      const toNode = dagreGraph.node(con.toNodeId);\n\n      firstPoint =\n        firstPoint.x !== secondPoint.x\n          ? {\n              ...edge.points[0],\n              x: fromNode.x,\n              y: edge.points[1].y\n            }\n          : firstPoint;\n\n      lastPoint =\n        lastPoint.x !== secondLastPoint.x\n          ? {\n              ...edge.points[lastIndex],\n              x: toNode.x,\n              y: edge.points[lastIndex - 1].y\n            }\n          : lastPoint;\n\n      con.points = [\n        { x: fromNode.x, y: fromNode.y + fromNode.height / 2 },\n        { ...firstPoint, y: firstPoint.y + 10 },\n        { ...secondPoint, y: secondPoint.y + 10 },\n        ...edge.points.slice(2, lastIndex),\n        lastPoint\n      ];\n\n      // Only add the last point incase the edge has an arc at end\n      if (edge.points[lastIndex].x !== edge.points[lastIndex - 1].x) {\n        con.points.push({ x: toNode.x, y: toNode.y });\n      }\n\n      // if current edge source node is an placeholder node move down the starting point of placeholder node by 12\n      if (fromNode.height === 0) {\n        con.points[0].y += 12;\n      }\n\n      const edgeLastPointIndex = con.points.length - 1;\n\n      // Move the merging arcs last point to the starting point of placeholder node\n      if (\n        con.points[edgeLastPointIndex].x === con.points[edgeLastPointIndex - 1].x &&\n        toNode.height === 0\n      ) {\n        con.points[edgeLastPointIndex].y += 12;\n      }\n    });\n\n    const { width } = dagreGraph.graph();\n    const { height } = dagreGraph.graph();\n\n    return {\n      width: Number.isFinite(width) ? width : DEFAULT_GRAPH_WIDTH,\n      height: Number.isFinite(height) ? height : DEFAULT_GRAPH_HEIGHT\n    };\n  }\n}\n"]}

package/lib/components/FlowModeller/Renderer/Utils/GraphTraversal.d.ts

@@ -0,0 +1,29 @@
+import type { ConnectorProps, GraphData, Node } from './Graph';
+import { DirectedGraph } from './Graph';
+export interface NestedArray<T> extends Array<T | NestedArray<T>> {
+}
+export interface ConvergenceData<T extends Node, U extends ConnectorProps> {
+    nodeId: string;
+    connectors: NestedArray<string>;
+    summary: {
+        nodesInvolved: Record<string, T>;
+        connectorsInvolved: Record<string, U>;
+    };
+    paths?: NestedArray<ConvergenceData<T, U>>;
+}
+export default class GraphTraversal {
+    static bfs(gd: GraphData, src?: string): string[];
+    static dfs(gd: GraphData, src?: string): string[];
+    static findRootNode(graph: DirectedGraph): string | false;
+    static findLeafNode(graph: DirectedGraph): string | false;
+    /**
+     * Given the graphData and the source node with morethan one branch, It calculates the convergence node, involved connectors and paths
+     * Assuming, goTo is not supported
+     *
+     * @param gd graphData to process on
+     * @param src id of the source node. This needs to be a node with multiple branches
+     * @returns id of the destination node or null if not found
+     */
+    static getConvergenceData<T extends Node = Node, U extends ConnectorProps = ConnectorProps>(gd: GraphData<T, U>, src: string): ConvergenceData<T, U> | false;
+}
+//# sourceMappingURL=GraphTraversal.d.ts.map

package/lib/components/FlowModeller/Renderer/Utils/GraphTraversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTraversal.d.ts","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphTraversal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAExC,MAAM,WAAW,WAAW,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;CAAG;AAEpE,MAAM,WAAW,eAAe,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,cAAc;IACvE,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;KACvC,CAAC;IACF,KAAK,CAAC,EAAE,WAAW,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAC5C;AAED,MAAM,CAAC,OAAO,OAAO,cAAc;IACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAmCjD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAyCjD,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,KAAK;IAazD,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,KAAK;IAUzD;;;;;;;OAOG;IAEH,MAAM,CAAC,kBAAkB,CAAC,CAAC,SAAS,IAAI,GAAG,IAAI,EAAE,CAAC,SAAS,cAAc,GAAG,cAAc,EACxF,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,GAAG,EAAE,MAAM,GACV,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;CA+HjC"}

package/lib/components/FlowModeller/Renderer/Utils/GraphTraversal.js

@@ -0,0 +1,191 @@
+import { DirectedGraph } from './Graph';
+export default class GraphTraversal {
+    static bfs(gd, src) {
+        const graph = new DirectedGraph(gd);
+        if (!src) {
+            const rootNodeId = GraphTraversal.findRootNode(graph);
+            if (!rootNodeId) {
+                throw Error('Invalid graph, cannot find root node.');
+            }
+            src = rootNodeId;
+        }
+        const queue = [src];
+        const result = [];
+        const map = { src }; // needed for duplicate comparison
+        while (queue.length > 0) {
+            const source = queue.shift();
+            if (source !== undefined) {
+                result.push(source);
+                const nextNodes = graph.getNextNodes(source);
+                nextNodes.forEach((node) => {
+                    if (!map[node.id]) {
+                        queue.push(node.id);
+                        map[node.id] = node.id;
+                    }
+                });
+            }
+        }
+        return result;
+    }
+    static dfs(gd, src) {
+        const graph = new DirectedGraph(gd);
+        // finding the start node automatically
+        if (!src) {
+            const rootNodeId = GraphTraversal.findRootNode(graph);
+            if (!rootNodeId) {
+                throw Error('Invalid graph, cannot find root node.');
+            }
+            src = rootNodeId;
+        }
+        const stack = [src];
+        const result = [];
+        const map = {
+            src
+        }; // needed for duplicate comparison
+        while (stack.length > 0) {
+            const source = stack.pop();
+            if (source !== undefined) {
+                result.push(source);
+                const nextNodes = graph.getNextNodes(source);
+                nextNodes.forEach(node => {
+                    if (map[node.id] === undefined) {
+                        stack.push(node.id);
+                        map[node.id] = node.id;
+                    }
+                });
+            }
+        }
+        return result;
+    }
+    // Assuming the given graph has no unconnected nodes and the graph is not cyclic(if start node have in-connectors(ie., cyclic), this will fail).
+    // - returns first encountered node with no in-connectors as a root node, if more than one exists
+    static findRootNode(graph) {
+        const nodes = graph.getNodes();
+        for (let i = 0; i < nodes.length; i += 1) {
+            if (graph.getPrevNodesCount(nodes[i].id) === 0) {
+                return nodes[i].id;
+            }
+        }
+        return false;
+    }
+    // - returns first encountered node with no out-connectors as a leaf node, if more than one exists
+    static findLeafNode(graph) {
+        for (const node of graph.getNodes()) {
+            if (graph.isLeaf(node.id)) {
+                return node.id;
+            }
+        }
+        return false;
+    }
+    /**
+     * Given the graphData and the source node with morethan one branch, It calculates the convergence node, involved connectors and paths
+     * Assuming, goTo is not supported
+     *
+     * @param gd graphData to process on
+     * @param src id of the source node. This needs to be a node with multiple branches
+     * @returns id of the destination node or null if not found
+     */
+    // TODO-OPTIMIZE Memoize, for a given GraphData
+    static getConvergenceData(gd, src) {
+        const graph = new DirectedGraph(gd);
+        // return false, if there is no node with given source node id
+        if (graph.getNode(src) === undefined || graph.getNextNodesCount(src) < 2) {
+            return false;
+        }
+        // traverse the nodes -- and record the paths of each connector
+        const path = []; // array of path-arrays
+        const initialConnectors = graph.getOutConnectors(src);
+        // iterate the initial set of connectors
+        initialConnectors.forEach((item, index) => {
+            path[index] = [];
+            let currentConnector = item;
+            // traverse through each connector and push the encountered nodes
+            while (currentConnector && currentConnector.toNodeId !== undefined) {
+                path[index].push({
+                    nodeId: currentConnector.toNodeId,
+                    connectors: [currentConnector.id],
+                    summary: {
+                        nodesInvolved: {
+                            [currentConnector.toNodeId]: graph.getNode(currentConnector.toNodeId)
+                        },
+                        connectorsInvolved: { [currentConnector.id]: currentConnector }
+                    }
+                });
+                const inConnectors = graph.getInConnectors(currentConnector.toNodeId);
+                // if this node has multiple in connectors, that means this is a join [IMP TODO NOTE until we support goTo option]
+                if (inConnectors.length > 1) {
+                    return;
+                }
+                let outConnectors = graph.getOutConnectors(currentConnector.toNodeId);
+                let newCurrentNodeId = currentConnector.toNodeId;
+                // check if this node has multiple branches and call recursively
+                while (outConnectors.length > 1) {
+                    const result = GraphTraversal.getConvergenceData(gd, newCurrentNodeId);
+                    // handle resultNodeId val as false use case: just cancel futher processing and return false
+                    if (result === false) {
+                        break;
+                    }
+                    // add result node to the path
+                    path[index].push(result);
+                    /** if the result node has multiple in-connectors and few of them(i.e foreign connectors or connector belonging to other/parent multi branch scenario)
+                     *  are not a part of the current multi branch scenario then the resultant node is a merging point for other branches.
+                     * **************************  Check for foreign connectors - START ************************** */
+                    const resultNodeInConnectors = Array.from(graph.getInConnectors(result.nodeId), con => con.id);
+                    // All the connectors involved in the current multi branch scenario
+                    const connectorsInvolved = Object.keys(result.summary.connectorsInvolved);
+                    let hasForeignConnector = false;
+                    for (let i = 0; i < resultNodeInConnectors.length; i += 1) {
+                        if (!connectorsInvolved.some(con => con === resultNodeInConnectors[i])) {
+                            hasForeignConnector = true;
+                            break;
+                        }
+                    }
+                    // if we have a foreign in-connector on result node then skip current path
+                    if (hasForeignConnector) {
+                        return;
+                    }
+                    // ************************** check for foreign connector - END **************************
+                    // handle, resultNode as a shape with multiple out-connectors(multi branch)
+                    outConnectors = graph.getOutConnectors(result.nodeId);
+                    newCurrentNodeId = result.nodeId;
+                }
+                // else if out connectors is 1
+                currentConnector = outConnectors[0];
+            }
+        });
+        // validate and return false if no convergence node found
+        for (let i = 1; i < path.length; i += 1) {
+            if (path[i][path[i].length - 1].nodeId !== path[i - 1][path[i - 1].length - 1].nodeId) {
+                return false;
+            }
+        }
+        const result = {
+            nodeId: path[0][path[0].length - 1].nodeId,
+            connectors: [],
+            paths: [],
+            summary: {
+                nodesInvolved: {},
+                connectorsInvolved: {}
+            }
+        };
+        for (let i = 0; i < path.length; i += 1) {
+            const current = path[i];
+            result.connectors.push(current[current.length - 1].connectors);
+            if (result.paths !== undefined) {
+                result.paths[i] = current;
+            }
+            current.forEach(item => {
+                result.summary.nodesInvolved = {
+                    ...result.summary.nodesInvolved,
+                    ...item.summary.nodesInvolved
+                };
+                result.summary.connectorsInvolved = {
+                    ...result.summary.connectorsInvolved,
+                    ...item.summary.connectorsInvolved
+                };
+            });
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=GraphTraversal.js.map

package/lib/components/FlowModeller/Renderer/Utils/GraphTraversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTraversal.js","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/GraphTraversal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAcxC,MAAM,CAAC,OAAO,OAAO,cAAc;IACjC,MAAM,CAAC,GAAG,CAAC,EAAa,EAAE,GAAY;QACpC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC;QAEpC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAEtD,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACvD,CAAC;YAED,GAAG,GAAG,UAAU,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,GAAG,GAA2B,EAAE,GAAG,EAAE,CAAC,CAAC,kCAAkC;QAE/E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAC7C,SAAS,CAAC,OAAO,CAAC,CAAC,IAAU,EAAE,EAAE;oBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;wBAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;oBACzB,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,EAAa,EAAE,GAAY;QACpC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC;QAEpC,uCAAuC;QACvC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAEtD,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,MAAM,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACvD,CAAC;YAED,GAAG,GAAG,UAAU,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,GAAG,GAA2B;YAClC,GAAG;SACJ,CAAC,CAAC,kCAAkC;QAErC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAE7C,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBACvB,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;wBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACpB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;oBACzB,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gJAAgJ;IAChJ,iGAAiG;IACjG,MAAM,CAAC,YAAY,CAAC,KAAoB;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kGAAkG;IAClG,MAAM,CAAC,YAAY,CAAC,KAAoB;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,+CAA+C;IAC/C,MAAM,CAAC,kBAAkB,CACvB,EAAmB,EACnB,GAAW;QAEX,MAAM,KAAK,GAAG,IAAI,aAAa,CAAO,EAAE,CAAC,CAAC;QAE1C,8DAA8D;QAC9D,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,+DAA+D;QAC/D,MAAM,IAAI,GAA8B,EAAE,CAAC,CAAC,uBAAuB;QACnE,MAAM,iBAAiB,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAEtD,wCAAwC;QACxC,iBAAiB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACxC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAEjB,IAAI,gBAAgB,GAAG,IAAI,CAAC;YAC5B,iEAAiE;YACjE,OAAO,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACnE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;oBACf,MAAM,EAAE,gBAAgB,CAAC,QAAQ;oBACjC,UAAU,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBACjC,OAAO,EAAE;wBACP,aAAa,EAAE;4BACb,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC;yBACtE;wBACD,kBAAkB,EAAE,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,gBAAgB,EAAE;qBAChE;iBACF,CAAC,CAAC;gBAEH,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBACtE,kHAAkH;gBAClH,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC5B,OAAO;gBACT,CAAC;gBAED,IAAI,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBAEtE,IAAI,gBAAgB,GAAG,gBAAgB,CAAC,QAAQ,CAAC;gBACjD,gEAAgE;gBAChE,OAAO,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;oBAEvE,4FAA4F;oBAC5F,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;wBACrB,MAAM;oBACR,CAAC;oBAED,8BAA8B;oBAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAEzB;;qHAEiG;oBACjG,MAAM,sBAAsB,GAAG,KAAK,CAAC,IAAI,CACvC,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,EACpC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CACd,CAAC;oBAEF,mEAAmE;oBACnE,MAAM,kBAAkB,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;oBAE1E,IAAI,mBAAmB,GAAG,KAAK,CAAC;oBAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC1D,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,sBAAsB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;4BACvE,mBAAmB,GAAG,IAAI,CAAC;4BAC3B,MAAM;wBACR,CAAC;oBACH,CAAC;oBACD,0EAA0E;oBAC1E,IAAI,mBAAmB,EAAE,CAAC;wBACxB,OAAO;oBACT,CAAC;oBACD,0FAA0F;oBAE1F,2EAA2E;oBAC3E,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACtD,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC;gBACnC,CAAC;gBAED,8BAA8B;gBAE9B,gBAAgB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,yDAAyD;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;gBACtF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAA0B;YACpC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM;YAC1C,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,EAAE;YACT,OAAO,EAAE;gBACP,aAAa,EAAE,EAAE;gBACjB,kBAAkB,EAAE,EAAE;aACvB;SACF,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAE/D,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YAC5B,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACrB,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG;oBAC7B,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa;oBAC/B,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa;iBAC9B,CAAC;gBAEF,MAAM,CAAC,OAAO,CAAC,kBAAkB,GAAG;oBAClC,GAAG,MAAM,CAAC,OAAO,CAAC,kBAAkB;oBACpC,GAAG,IAAI,CAAC,OAAO,CAAC,kBAAkB;iBACnC,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","sourcesContent":["import type { ConnectorProps, GraphData, Node } from './Graph';\nimport { DirectedGraph } from './Graph';\n\nexport interface NestedArray<T> extends Array<T | NestedArray<T>> {}\n\nexport interface ConvergenceData<T extends Node, U extends ConnectorProps> {\n  nodeId: string;\n  connectors: NestedArray<string>;\n  summary: {\n    nodesInvolved: Record<string, T>;\n    connectorsInvolved: Record<string, U>;\n  };\n  paths?: NestedArray<ConvergenceData<T, U>>;\n}\n\nexport default class GraphTraversal {\n  static bfs(gd: GraphData, src?: string): string[] {\n    const graph = new DirectedGraph(gd);\n\n    if (!src) {\n      const rootNodeId = GraphTraversal.findRootNode(graph);\n\n      if (!rootNodeId) {\n        throw Error('Invalid graph, cannot find root node.');\n      }\n\n      src = rootNodeId;\n    }\n\n    const queue: string[] = [src];\n    const result: string[] = [];\n    const map: Record<string, string> = { src }; // needed for duplicate comparison\n\n    while (queue.length > 0) {\n      const source = queue.shift();\n      if (source !== undefined) {\n        result.push(source);\n\n        const nextNodes = graph.getNextNodes(source);\n        nextNodes.forEach((node: Node) => {\n          if (!map[node.id]) {\n            queue.push(node.id);\n            map[node.id] = node.id;\n          }\n        });\n      }\n    }\n\n    return result;\n  }\n\n  static dfs(gd: GraphData, src?: string): string[] {\n    const graph = new DirectedGraph(gd);\n\n    // finding the start node automatically\n    if (!src) {\n      const rootNodeId = GraphTraversal.findRootNode(graph);\n\n      if (!rootNodeId) {\n        throw Error('Invalid graph, cannot find root node.');\n      }\n\n      src = rootNodeId;\n    }\n\n    const stack: string[] = [src];\n    const result: string[] = [];\n    const map: Record<string, string> = {\n      src\n    }; // needed for duplicate comparison\n\n    while (stack.length > 0) {\n      const source = stack.pop();\n      if (source !== undefined) {\n        result.push(source);\n\n        const nextNodes = graph.getNextNodes(source);\n\n        nextNodes.forEach(node => {\n          if (map[node.id] === undefined) {\n            stack.push(node.id);\n            map[node.id] = node.id;\n          }\n        });\n      }\n    }\n\n    return result;\n  }\n\n  // Assuming the given graph has no unconnected nodes and the graph is not cyclic(if start node have in-connectors(ie., cyclic), this will fail).\n  // - returns first encountered node with no in-connectors as a root node, if more than one exists\n  static findRootNode(graph: DirectedGraph): string | false {\n    const nodes = graph.getNodes();\n\n    for (let i = 0; i < nodes.length; i += 1) {\n      if (graph.getPrevNodesCount(nodes[i].id) === 0) {\n        return nodes[i].id;\n      }\n    }\n\n    return false;\n  }\n\n  // - returns first encountered node with no out-connectors as a leaf node, if more than one exists\n  static findLeafNode(graph: DirectedGraph): string | false {\n    for (const node of graph.getNodes()) {\n      if (graph.isLeaf(node.id)) {\n        return node.id;\n      }\n    }\n\n    return false;\n  }\n\n  /**\n   * Given the graphData and the source node with morethan one branch, It calculates the convergence node, involved connectors and paths\n   * Assuming, goTo is not supported\n   *\n   * @param gd graphData to process on\n   * @param src id of the source node. This needs to be a node with multiple branches\n   * @returns id of the destination node or null if not found\n   */\n  // TODO-OPTIMIZE Memoize, for a given GraphData\n  static getConvergenceData<T extends Node = Node, U extends ConnectorProps = ConnectorProps>(\n    gd: GraphData<T, U>,\n    src: string\n  ): ConvergenceData<T, U> | false {\n    const graph = new DirectedGraph<T, U>(gd);\n\n    // return false, if there is no node with given source node id\n    if (graph.getNode(src) === undefined || graph.getNextNodesCount(src) < 2) {\n      return false;\n    }\n\n    // traverse the nodes -- and record the paths of each connector\n    const path: ConvergenceData<T, U>[][] = []; // array of path-arrays\n    const initialConnectors = graph.getOutConnectors(src);\n\n    // iterate the initial set of connectors\n    initialConnectors.forEach((item, index) => {\n      path[index] = [];\n\n      let currentConnector = item;\n      // traverse through each connector and push the encountered nodes\n      while (currentConnector && currentConnector.toNodeId !== undefined) {\n        path[index].push({\n          nodeId: currentConnector.toNodeId,\n          connectors: [currentConnector.id],\n          summary: {\n            nodesInvolved: {\n              [currentConnector.toNodeId]: graph.getNode(currentConnector.toNodeId)\n            },\n            connectorsInvolved: { [currentConnector.id]: currentConnector }\n          }\n        });\n\n        const inConnectors = graph.getInConnectors(currentConnector.toNodeId);\n        // if this node has multiple in connectors, that means this is a join [IMP TODO NOTE until we support goTo option]\n        if (inConnectors.length > 1) {\n          return;\n        }\n\n        let outConnectors = graph.getOutConnectors(currentConnector.toNodeId);\n\n        let newCurrentNodeId = currentConnector.toNodeId;\n        // check if this node has multiple branches and call recursively\n        while (outConnectors.length > 1) {\n          const result = GraphTraversal.getConvergenceData(gd, newCurrentNodeId);\n\n          // handle resultNodeId val as false use case: just cancel futher processing and return false\n          if (result === false) {\n            break;\n          }\n\n          // add result node to the path\n          path[index].push(result);\n\n          /** if the result node has multiple in-connectors and few of them(i.e foreign connectors or connector belonging to other/parent multi branch scenario)\n           *  are not a part of the current multi branch scenario then the resultant node is a merging point for other branches.\n           * **************************  Check for foreign connectors - START ************************** */\n          const resultNodeInConnectors = Array.from(\n            graph.getInConnectors(result.nodeId),\n            con => con.id\n          );\n\n          // All the connectors involved in the current multi branch scenario\n          const connectorsInvolved = Object.keys(result.summary.connectorsInvolved);\n\n          let hasForeignConnector = false;\n\n          for (let i = 0; i < resultNodeInConnectors.length; i += 1) {\n            if (!connectorsInvolved.some(con => con === resultNodeInConnectors[i])) {\n              hasForeignConnector = true;\n              break;\n            }\n          }\n          // if we have a foreign in-connector on result node then skip current path\n          if (hasForeignConnector) {\n            return;\n          }\n          // ************************** check for foreign connector - END **************************\n\n          // handle, resultNode as a shape with multiple out-connectors(multi branch)\n          outConnectors = graph.getOutConnectors(result.nodeId);\n          newCurrentNodeId = result.nodeId;\n        }\n\n        // else if out connectors is 1\n\n        currentConnector = outConnectors[0];\n      }\n    });\n\n    // validate and return false if no convergence node found\n    for (let i = 1; i < path.length; i += 1) {\n      if (path[i][path[i].length - 1].nodeId !== path[i - 1][path[i - 1].length - 1].nodeId) {\n        return false;\n      }\n    }\n\n    const result: ConvergenceData<T, U> = {\n      nodeId: path[0][path[0].length - 1].nodeId,\n      connectors: [],\n      paths: [],\n      summary: {\n        nodesInvolved: {},\n        connectorsInvolved: {}\n      }\n    };\n\n    for (let i = 0; i < path.length; i += 1) {\n      const current = path[i];\n      result.connectors.push(current[current.length - 1].connectors);\n\n      if (result.paths !== undefined) {\n        result.paths[i] = current;\n      }\n\n      current.forEach(item => {\n        result.summary.nodesInvolved = {\n          ...result.summary.nodesInvolved,\n          ...item.summary.nodesInvolved\n        };\n\n        result.summary.connectorsInvolved = {\n          ...result.summary.connectorsInvolved,\n          ...item.summary.connectorsInvolved\n        };\n      });\n    }\n\n    return result;\n  }\n}\n"]}

package/lib/components/FlowModeller/Renderer/Utils/RendererUtils.d.ts

@@ -0,0 +1,38 @@
+import { DirectedGraph } from './Graph';
+import type { PlottedGraphConnector, PlottedGraphNode } from './GraphLayout';
+import type { ConvergenceData } from './GraphTraversal';
+export type ParentConvergence = {
+    convergence: ConvergenceData<PlottedGraphNode, PlottedGraphConnector>;
+    pathIndex: number;
+    itemIndexInPath: number;
+    parent: PlottedGraphNode;
+};
+/**
+ * Checks if the given graphItem is a part of multi branch convergence scenario and returns the convergence data and parent id
+ * @param graphItem - node or connector
+ * @param graph - Directed graph object
+ */
+export declare const getParentConvergence: (graphItem: PlottedGraphNode | PlottedGraphConnector, graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>) => ParentConvergence | false;
+/** Returns an object where keys are y-cords of node/connector and
+ * values are an array of node/connector id's having same y-cord as key
+ * @param graph - Directed graph object
+ */
+export declare const groupByPosition: (graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>) => Record<string, [string]>;
+interface VerticalNavigationProps {
+    activeGraphItemId: string;
+    activeGraphItem: PlottedGraphNode | PlottedGraphConnector;
+    readOnly: boolean;
+    graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>;
+}
+interface HorizontalNavigationProps {
+    activeGraphItem: VerticalNavigationProps['activeGraphItem'];
+    keyEvent: 'ArrowLeft' | 'ArrowRight';
+    positions: Record<string, [string]>;
+    graph: DirectedGraph<PlottedGraphNode, PlottedGraphConnector>;
+    readOnly?: boolean;
+}
+export declare const arrowUpKey: ({ activeGraphItemId, activeGraphItem, readOnly, graph }: VerticalNavigationProps) => string | false | undefined;
+export declare const arrowDownKey: ({ activeGraphItemId, activeGraphItem, readOnly, graph }: VerticalNavigationProps) => string | false;
+export declare const horizontalNavigation: ({ positions, activeGraphItem, keyEvent, graph, readOnly }: HorizontalNavigationProps) => string | undefined;
+export {};
+//# sourceMappingURL=RendererUtils.d.ts.map

package/lib/components/FlowModeller/Renderer/Utils/RendererUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RendererUtils.d.ts","sourceRoot":"","sources":["../../../../../src/components/FlowModeller/Renderer/Utils/RendererUtils.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAExC,OAAO,KAAK,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAE7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAExD,MAAM,MAAM,iBAAiB,GAAG;IAC9B,WAAW,EAAE,eAAe,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,CAAC;IACtE,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,gBAAgB,CAAC;CAC1B,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,oBAAoB,GAC/B,WAAW,gBAAgB,GAAG,qBAAqB,EACnD,OAAO,aAAa,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,KAC5D,iBAAiB,GAAG,KA+CtB,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,eAAe,GAAI,OAAO,aAAa,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,6BAoE5F,CAAC;AAEF,UAAU,uBAAuB;IAC/B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,gBAAgB,GAAG,qBAAqB,CAAC;IAC1D,QAAQ,EAAE,OAAO,CAAC;IAClB,KAAK,EAAE,aAAa,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,CAAC;CAC/D;AAED,UAAU,yBAAyB;IACjC,eAAe,EAAE,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;IAC5D,QAAQ,EAAE,WAAW,GAAG,YAAY,CAAC;IACrC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACpC,KAAK,EAAE,aAAa,CAAC,gBAAgB,EAAE,qBAAqB,CAAC,CAAC;IAC9D,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,eAAO,MAAM,UAAU,GAAI,yDAKxB,uBAAuB,+BA4CzB,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,yDAK1B,uBAAuB,mBA4BzB,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAAI,2DAMlC,yBAAyB,uBA+K3B,CAAC"}