@teambit/graph 1.0.166 → 1.0.168

package/dist/component-id-graph.d.ts

@@ -1,12 +1,16 @@
-import { ComponentID } from '@teambit/component';
+import { ComponentID } from '@teambit/component-id';
 import { Graph, Node, Edge } from '@teambit/graph.cleargraph';
+import type { DependenciesInfo } from '@teambit/legacy/dist/scope/graph/scope-graph';
+import GraphLib from 'graphlib';
 export type DepEdgeType = 'prod' | 'dev' | 'ext';
 type ComponentIdNode = Node<ComponentID>;
 type DependencyEdge = Edge<DepEdgeType>;
 export type CompIdGraph = Graph<ComponentID, DepEdgeType>;
 export declare class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {
+    private _graphLib;
     seederIds: ComponentID[];
     constructor(nodes?: ComponentIdNode[], edges?: DependencyEdge[]);
+    get graphLib(): GraphLib.Graph;
     protected create(nodes?: ComponentIdNode[], edges?: DependencyEdge[]): this;
     /**
      * check all the routes from the sources to targets and return the components found during this traversal.
@@ -38,6 +42,8 @@ export declare class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {
     findCycles(graph?: this, includeDeps?: boolean): string[][];
     buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph;
     runtimeOnly(componentIds: string[]): this;
+    getDependenciesInfo(id: ComponentID): DependenciesInfo[];
+    getDependenciesAsObjectTree(idStr: string): Record<string, any>;
     private shouldLimitToSeedersOnly;
 }
 export {};

package/dist/component-id-graph.js

@@ -4,6 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.ComponentIdGraph = void 0;
+function _componentId() {
+  const data = require("@teambit/component-id");
+  _componentId = function () {
+    return data;
+  };
+  return data;
+}
 function _graph() {
   const data = require("@teambit/graph.cleargraph");
   _graph = function () {
@@ -11,6 +18,13 @@ function _graph() {
   };
   return data;
 }
+function _graphlib() {
+  const data = _interopRequireDefault(require("graphlib"));
+  _graphlib = function () {
+    return data;
+  };
+  return data;
+}
 function _lodash() {
   const data = require("lodash");
   _lodash = function () {
@@ -18,6 +32,7 @@ function _lodash() {
   };
   return data;
 }
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
 function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
 function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
@@ -25,8 +40,22 @@ class ComponentIdGraph extends _graph().Graph {
   // component IDs that started the graph. (if from workspace, the .bitmap ids normally)
   constructor(nodes = [], edges = []) {
     super(nodes, edges);
+    _defineProperty(this, "_graphLib", void 0);
     _defineProperty(this, "seederIds", []);
   }
+  get graphLib() {
+    if (!this._graphLib) {
+      // convert clearGraph to graphLib
+      this._graphLib = new (_graphlib().default.Graph)();
+      this.nodes.forEach(node => {
+        this._graphLib.setNode(node.id.toString());
+      });
+      this.edges.forEach(edge => {
+        this._graphLib.setEdge(edge.sourceId.toString(), edge.targetId.toString(), edge.attr);
+      });
+    }
+    return this._graphLib;
+  }
   create(nodes = [], edges = []) {
     return new ComponentIdGraph(nodes, edges);
   }
@@ -148,6 +177,57 @@ class ComponentIdGraph extends _graph().Graph {
       edgeFilter: edge => edge.attr === 'prod'
     });
   }
+  getDependenciesInfo(id) {
+    const dijkstraResults = _graphlib().default.alg.dijkstra(this.graphLib, id.toString());
+    const dependencies = [];
+    Object.keys(dijkstraResults).forEach(idStr => {
+      const distance = dijkstraResults[idStr].distance;
+      if (distance === Infinity || distance === 0) {
+        // there is no dependency or it's the same component (distance zero)
+        return;
+      }
+      const predecessor = dijkstraResults[idStr].predecessor;
+      const dependencyType = this.edge(predecessor, idStr);
+      dependencies.push({
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        id: this.node(idStr).attr,
+        depth: distance,
+        parent: predecessor,
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        dependencyType: dependencyType.attr
+      });
+    });
+    dependencies.sort((a, b) => a.depth - b.depth);
+    return dependencies;
+  }
+  getDependenciesAsObjectTree(idStr) {
+    const depsInfo = this.getDependenciesInfo(_componentId().ComponentID.fromString(idStr));
+    const populateTreeItems = (id, treeItems) => {
+      const children = depsInfo.filter(depInfo => depInfo.parent === id);
+      if (!children || children.length === 0) {
+        return;
+      }
+      children.forEach(child => {
+        const {
+          id: compId
+        } = child;
+        const label = compId.toString();
+        const currentNodes = [];
+        treeItems.push({
+          label,
+          nodes: currentNodes
+        });
+        populateTreeItems(label, currentNodes);
+      });
+    };
+    const currentNodes = [];
+    const tree = {
+      label: idStr,
+      nodes: currentNodes
+    };
+    populateTreeItems(idStr, currentNodes);
+    return tree;
+  }
   shouldLimitToSeedersOnly() {
     return this.seederIds.length;
   }

package/dist/component-id-graph.js.map

@@ -1 +1 @@
-{"version":3,"names":["_graph","data","require","_lodash","_defineProperty","obj","key","value","_toPropertyKey","Object","defineProperty","enumerable","configurable","writable","t","i","_toPrimitive","String","r","e","Symbol","toPrimitive","call","TypeError","Number","ComponentIdGraph","Graph","constructor","nodes","edges","create","findIdsFromSourcesToTargets","sources","targets","through","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","allFlattened","source","successors","toString","flat","allFlattenedIds","uniq","f","id","results","forEach","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","componentIds","getNodes","n","attr","length","resultsWithThrough","throughStr","allGraph","subgraph","allGraphWithNoVersion","every","findAllPathsFromSourcesToTargets","traverseDFS","node","visitedInPath","visitedInGraph","allPaths","Array","from","successorMap","values","filter","pathWithVer","pathWithoutVer","p","filtered","path","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","cycle","some","cycleIdStr","buildFromCleargraph","runtimeOnly","successorsSubgraph","edgeFilter","edge","exports"],"sources":["component-id-graph.ts"],"sourcesContent":["import { ComponentID } from '@teambit/component';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport { uniq } from 'lodash';\n\nexport type DepEdgeType = 'prod' | 'dev' | 'ext';\n\ntype ComponentIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<DepEdgeType>;\nexport type CompIdGraph = Graph<ComponentID, DepEdgeType>;\n\nexport class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  protected create(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentIdGraph(nodes, edges) as this;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: [B, C, E].\n   *\n   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[], through?: ComponentID[]): ComponentID[] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const sourcesStr = sources.map((s) => s.toStringWithoutVersion());\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const allFlattened = sources.map((source) => this.successors(source.toString())).flat();\n    const allFlattenedIds = uniq(allFlattened.map((f) => f.id));\n    const results: string[] = [];\n    allFlattenedIds.forEach((id) => {\n      const idWithNoVer = removeVerFromIdStr(id);\n      if (sourcesStr.includes(idWithNoVer) || targetsStr.includes(idWithNoVer)) return;\n      const allSuccessors = this.successors(id);\n      const allSuccessorsWithNoVersion = allSuccessors.map((s) => removeVerFromIdStr(s.id));\n      if (allSuccessorsWithNoVersion.find((s) => targetsStr.includes(s))) results.push(id);\n    });\n    const componentIds = this.getNodes(results).map((n) => n.attr);\n\n    if (!through?.length) {\n      return componentIds;\n    }\n\n    const resultsWithThrough: ComponentID[] = [];\n    const throughStr = through.map((t) => t.toStringWithoutVersion());\n    componentIds.forEach((id) => {\n      const allGraph = this.subgraph(id.toString()).nodes.map((n) => n.id); // successors and predecessors\n      const allGraphWithNoVersion = allGraph.map((s) => removeVerFromIdStr(s));\n      if (throughStr.every((t) => allGraphWithNoVersion.includes(t))) resultsWithThrough.push(id);\n    });\n\n    return resultsWithThrough;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: [B, C, E].\n   *\n   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findAllPathsFromSourcesToTargets(\n    sources: ComponentID[],\n    targets: ComponentID[],\n    through?: ComponentID[]\n  ): string[][] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n\n    const traverseDFS = (\n      node: string,\n      visitedInPath: string[],\n      visitedInGraph: string[] = [],\n      allPaths: string[][]\n    ) => {\n      if (visitedInPath.includes(node)) return;\n      visitedInPath.push(node);\n      if (targetsStr.includes(removeVerFromIdStr(node))) {\n        allPaths.push(visitedInPath);\n        return;\n      }\n      if (visitedInGraph.includes(node)) return;\n      visitedInGraph.push(node);\n      const successors = Array.from(this.successorMap(node).values());\n      successors.forEach((s) => {\n        traverseDFS(s.id, [...visitedInPath], visitedInGraph, allPaths);\n      });\n    };\n\n    let allPaths: string[][] = [];\n    sources.forEach((source) => {\n      traverseDFS(source.toString(), [], [], allPaths);\n    });\n\n    if (through?.length) {\n      allPaths = allPaths.filter((pathWithVer) => {\n        const pathWithoutVer = pathWithVer.map((p) => removeVerFromIdStr(p));\n        return through.every((t) => pathWithoutVer.includes(t.toStringWithoutVersion()));\n      });\n    }\n\n    const sourcesStr = sources.map((s) => s.toString());\n    const filtered = allPaths.filter((path) => {\n      if (path.length < 3) {\n        // if length is 1, the source and target are the same.\n        // if length is 2, the target is a direct dependency of the source. we don't care about it.\n        return false;\n      }\n      const [, firstDep] = path;\n      if (sourcesStr.includes(firstDep)) {\n        // the first item is the source. the second item \"firstDep\" can be a direct dependency of one of the sources.\n        // if this is the case, we have already an exact path without this firstDep.\n        return true;\n      }\n      return true;\n    });\n\n    return filtered.sort((a, b) => a.length - b.length);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this, includeDeps = false): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly() || includeDeps) {\n      return cycles;\n    }\n    const seederIdsStr = this.seederIds.map((id) => id.toString());\n    const cyclesWithSeeders = cycles.filter((cycle) => {\n      return cycle.some((cycleIdStr) => seederIdsStr.includes(cycleIdStr));\n    });\n    return cyclesWithSeeders;\n  }\n\n  buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph {\n    return this.create(graph.nodes, graph.edges);\n  }\n\n  runtimeOnly(componentIds: string[]) {\n    return this.successorsSubgraph(componentIds, {\n      edgeFilter: (edge: DependencyEdge) => edge.attr === 'prod',\n    });\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n}\n"],"mappings":";;;;;;AACA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,QAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,OAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8B,SAAAG,gBAAAC,GAAA,EAAAC,GAAA,EAAAC,KAAA,IAAAD,GAAA,GAAAE,cAAA,CAAAF,GAAA,OAAAA,GAAA,IAAAD,GAAA,IAAAI,MAAA,CAAAC,cAAA,CAAAL,GAAA,EAAAC,GAAA,IAAAC,KAAA,EAAAA,KAAA,EAAAI,UAAA,QAAAC,YAAA,QAAAC,QAAA,oBAAAR,GAAA,CAAAC,GAAA,IAAAC,KAAA,WAAAF,GAAA;AAAA,SAAAG,eAAAM,CAAA,QAAAC,CAAA,GAAAC,YAAA,CAAAF,CAAA,uCAAAC,CAAA,GAAAA,CAAA,GAAAE,MAAA,CAAAF,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAI,CAAA,2BAAAJ,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAK,CAAA,GAAAL,CAAA,CAAAM,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAJ,CAAA,GAAAI,CAAA,CAAAG,IAAA,CAAAR,CAAA,EAAAI,CAAA,uCAAAH,CAAA,SAAAA,CAAA,YAAAQ,SAAA,yEAAAL,CAAA,GAAAD,MAAA,GAAAO,MAAA,EAAAV,CAAA;AAQvB,MAAMW,gBAAgB,SAASC,cAAK,CAA2B;EACrC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACzB,eAAA,oBAFK,EAAE;EAG7B;EAEU0B,MAAMA,CAACF,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAQ;IAClF,OAAO,IAAIJ,gBAAgB,CAACG,KAAK,EAAEC,KAAK,CAAC;EAC3C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEE,2BAA2BA,CAACC,OAAsB,EAAEC,OAAsB,EAAEC,OAAuB,EAAiB;IAClH,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEzB,CAAC,IAAKA,CAAC,CAAC2B,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAME,YAAY,GAAGX,OAAO,CAACO,GAAG,CAAEK,MAAM,IAAK,IAAI,CAACC,UAAU,CAACD,MAAM,CAACE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,CAAC;IACvF,MAAMC,eAAe,GAAG,IAAAC,cAAI,EAACN,YAAY,CAACJ,GAAG,CAAEW,CAAC,IAAKA,CAAC,CAACC,EAAE,CAAC,CAAC;IAC3D,MAAMC,OAAiB,GAAG,EAAE;IAC5BJ,eAAe,CAACK,OAAO,CAAEF,EAAE,IAAK;MAC9B,MAAMG,WAAW,GAAGnB,kBAAkB,CAACgB,EAAE,CAAC;MAC1C,IAAIb,UAAU,CAACiB,QAAQ,CAACD,WAAW,CAAC,IAAIZ,UAAU,CAACa,QAAQ,CAACD,WAAW,CAAC,EAAE;MAC1E,MAAME,aAAa,GAAG,IAAI,CAACX,UAAU,CAACM,EAAE,CAAC;MACzC,MAAMM,0BAA0B,GAAGD,aAAa,CAACjB,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAACW,EAAE,CAAC,CAAC;MACrF,IAAIM,0BAA0B,CAACC,IAAI,CAAElB,CAAC,IAAKE,UAAU,CAACa,QAAQ,CAACf,CAAC,CAAC,CAAC,EAAEY,OAAO,CAACO,IAAI,CAACR,EAAE,CAAC;IACtF,CAAC,CAAC;IACF,MAAMS,YAAY,GAAG,IAAI,CAACC,QAAQ,CAACT,OAAO,CAAC,CAACb,GAAG,CAAEuB,CAAC,IAAKA,CAAC,CAACC,IAAI,CAAC;IAE9D,IAAI,CAAC7B,OAAO,EAAE8B,MAAM,EAAE;MACpB,OAAOJ,YAAY;IACrB;IAEA,MAAMK,kBAAiC,GAAG,EAAE;IAC5C,MAAMC,UAAU,GAAGhC,OAAO,CAACK,GAAG,CAAEzB,CAAC,IAAKA,CAAC,CAAC2B,sBAAsB,CAAC,CAAC,CAAC;IACjEmB,YAAY,CAACP,OAAO,CAAEF,EAAE,IAAK;MAC3B,MAAMgB,QAAQ,GAAG,IAAI,CAACC,QAAQ,CAACjB,EAAE,CAACL,QAAQ,CAAC,CAAC,CAAC,CAAClB,KAAK,CAACW,GAAG,CAAEuB,CAAC,IAAKA,CAAC,CAACX,EAAE,CAAC,CAAC,CAAC;MACtE,MAAMkB,qBAAqB,GAAGF,QAAQ,CAAC5B,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAAC,CAAC;MACxE,IAAI0B,UAAU,CAACI,KAAK,CAAExD,CAAC,IAAKuD,qBAAqB,CAACd,QAAQ,CAACzC,CAAC,CAAC,CAAC,EAAEmD,kBAAkB,CAACN,IAAI,CAACR,EAAE,CAAC;IAC7F,CAAC,CAAC;IAEF,OAAOc,kBAAkB;EAC3B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEM,gCAAgCA,CAC9BvC,OAAsB,EACtBC,OAAsB,EACtBC,OAAuB,EACX;IACZ,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMK,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEzB,CAAC,IAAKA,CAAC,CAAC2B,sBAAsB,CAAC,CAAC,CAAC;IAEjE,MAAM+B,WAAW,GAAGA,CAClBC,IAAY,EACZC,aAAuB,EACvBC,cAAwB,GAAG,EAAE,EAC7BC,QAAoB,KACjB;MACH,IAAIF,aAAa,CAACnB,QAAQ,CAACkB,IAAI,CAAC,EAAE;MAClCC,aAAa,CAACf,IAAI,CAACc,IAAI,CAAC;MACxB,IAAI/B,UAAU,CAACa,QAAQ,CAACpB,kBAAkB,CAACsC,IAAI,CAAC,CAAC,EAAE;QACjDG,QAAQ,CAACjB,IAAI,CAACe,aAAa,CAAC;QAC5B;MACF;MACA,IAAIC,cAAc,CAACpB,QAAQ,CAACkB,IAAI,CAAC,EAAE;MACnCE,cAAc,CAAChB,IAAI,CAACc,IAAI,CAAC;MACzB,MAAM5B,UAAU,GAAGgC,KAAK,CAACC,IAAI,CAAC,IAAI,CAACC,YAAY,CAACN,IAAI,CAAC,CAACO,MAAM,CAAC,CAAC,CAAC;MAC/DnC,UAAU,CAACQ,OAAO,CAAEb,CAAC,IAAK;QACxBgC,WAAW,CAAChC,CAAC,CAACW,EAAE,EAAE,CAAC,GAAGuB,aAAa,CAAC,EAAEC,cAAc,EAAEC,QAAQ,CAAC;MACjE,CAAC,CAAC;IACJ,CAAC;IAED,IAAIA,QAAoB,GAAG,EAAE;IAC7B5C,OAAO,CAACqB,OAAO,CAAET,MAAM,IAAK;MAC1B4B,WAAW,CAAC5B,MAAM,CAACE,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE8B,QAAQ,CAAC;IAClD,CAAC,CAAC;IAEF,IAAI1C,OAAO,EAAE8B,MAAM,EAAE;MACnBY,QAAQ,GAAGA,QAAQ,CAACK,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAAC3C,GAAG,CAAE6C,CAAC,IAAKjD,kBAAkB,CAACiD,CAAC,CAAC,CAAC;QACpE,OAAOlD,OAAO,CAACoC,KAAK,CAAExD,CAAC,IAAKqE,cAAc,CAAC5B,QAAQ,CAACzC,CAAC,CAAC2B,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACM,QAAQ,CAAC,CAAC,CAAC;IACnD,MAAMuC,QAAQ,GAAGT,QAAQ,CAACK,MAAM,CAAEK,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACtB,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAGuB,QAAQ,CAAC,GAAGD,IAAI;MACzB,IAAIhD,UAAU,CAACiB,QAAQ,CAACgC,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOF,QAAQ,CAACG,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACzB,MAAM,GAAG0B,CAAC,CAAC1B,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE2B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC,IAAI,CAAC,IAAI,CAACG,wBAAwB,CAAC,CAAC,IAAIF,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAME,YAAY,GAAG,IAAI,CAACC,SAAS,CAAC1D,GAAG,CAAEY,EAAE,IAAKA,EAAE,CAACL,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAMoD,iBAAiB,GAAGJ,MAAM,CAACb,MAAM,CAAEkB,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKL,YAAY,CAACzC,QAAQ,CAAC8C,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOH,iBAAiB;EAC1B;EAEAI,mBAAmBA,CAACV,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAAC9D,MAAM,CAAC8D,KAAK,CAAChE,KAAK,EAAEgE,KAAK,CAAC/D,KAAK,CAAC;EAC9C;EAEA0E,WAAWA,CAAC3C,YAAsB,EAAE;IAClC,OAAO,IAAI,CAAC4C,kBAAkB,CAAC5C,YAAY,EAAE;MAC3C6C,UAAU,EAAGC,IAAoB,IAAKA,IAAI,CAAC3C,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEQgC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACjC,MAAM;EAC9B;AACF;AAAC2C,OAAA,CAAAlF,gBAAA,GAAAA,gBAAA"}
+{"version":3,"names":["_componentId","data","require","_graph","_graphlib","_interopRequireDefault","_lodash","obj","__esModule","default","_defineProperty","key","value","_toPropertyKey","Object","defineProperty","enumerable","configurable","writable","t","i","_toPrimitive","String","r","e","Symbol","toPrimitive","call","TypeError","Number","ComponentIdGraph","Graph","constructor","nodes","edges","graphLib","_graphLib","GraphLib","forEach","node","setNode","id","toString","edge","setEdge","sourceId","targetId","attr","create","findIdsFromSourcesToTargets","sources","targets","through","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","allFlattened","source","successors","flat","allFlattenedIds","uniq","f","results","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","componentIds","getNodes","n","length","resultsWithThrough","throughStr","allGraph","subgraph","allGraphWithNoVersion","every","findAllPathsFromSourcesToTargets","traverseDFS","visitedInPath","visitedInGraph","allPaths","Array","from","successorMap","values","filter","pathWithVer","pathWithoutVer","p","filtered","path","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","cycle","some","cycleIdStr","buildFromCleargraph","runtimeOnly","successorsSubgraph","edgeFilter","getDependenciesInfo","dijkstraResults","alg","dijkstra","dependencies","keys","distance","Infinity","predecessor","dependencyType","depth","parent","getDependenciesAsObjectTree","depsInfo","ComponentID","fromString","populateTreeItems","treeItems","children","depInfo","child","compId","label","currentNodes","tree","exports"],"sources":["component-id-graph.ts"],"sourcesContent":["import { ComponentID } from '@teambit/component-id';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport type { DependenciesInfo } from '@teambit/legacy/dist/scope/graph/scope-graph';\nimport GraphLib from 'graphlib';\nimport { uniq } from 'lodash';\n\nexport type DepEdgeType = 'prod' | 'dev' | 'ext';\n\ntype ComponentIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<DepEdgeType>;\nexport type CompIdGraph = Graph<ComponentID, DepEdgeType>;\n\nexport class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {\n  private _graphLib: GraphLib.Graph;\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  get graphLib() {\n    if (!this._graphLib) {\n      // convert clearGraph to graphLib\n      this._graphLib = new GraphLib.Graph();\n      this.nodes.forEach((node) => {\n        this._graphLib.setNode(node.id.toString());\n      });\n      this.edges.forEach((edge) => {\n        this._graphLib.setEdge(edge.sourceId.toString(), edge.targetId.toString(), edge.attr);\n      });\n    }\n    return this._graphLib;\n  }\n\n  protected create(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentIdGraph(nodes, edges) as this;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: [B, C, E].\n   *\n   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[], through?: ComponentID[]): ComponentID[] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const sourcesStr = sources.map((s) => s.toStringWithoutVersion());\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const allFlattened = sources.map((source) => this.successors(source.toString())).flat();\n    const allFlattenedIds = uniq(allFlattened.map((f) => f.id));\n    const results: string[] = [];\n    allFlattenedIds.forEach((id) => {\n      const idWithNoVer = removeVerFromIdStr(id);\n      if (sourcesStr.includes(idWithNoVer) || targetsStr.includes(idWithNoVer)) return;\n      const allSuccessors = this.successors(id);\n      const allSuccessorsWithNoVersion = allSuccessors.map((s) => removeVerFromIdStr(s.id));\n      if (allSuccessorsWithNoVersion.find((s) => targetsStr.includes(s))) results.push(id);\n    });\n    const componentIds = this.getNodes(results).map((n) => n.attr);\n\n    if (!through?.length) {\n      return componentIds;\n    }\n\n    const resultsWithThrough: ComponentID[] = [];\n    const throughStr = through.map((t) => t.toStringWithoutVersion());\n    componentIds.forEach((id) => {\n      const allGraph = this.subgraph(id.toString()).nodes.map((n) => n.id); // successors and predecessors\n      const allGraphWithNoVersion = allGraph.map((s) => removeVerFromIdStr(s));\n      if (throughStr.every((t) => allGraphWithNoVersion.includes(t))) resultsWithThrough.push(id);\n    });\n\n    return resultsWithThrough;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: [B, C, E].\n   *\n   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findAllPathsFromSourcesToTargets(\n    sources: ComponentID[],\n    targets: ComponentID[],\n    through?: ComponentID[]\n  ): string[][] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n\n    const traverseDFS = (\n      node: string,\n      visitedInPath: string[],\n      visitedInGraph: string[] = [],\n      allPaths: string[][]\n    ) => {\n      if (visitedInPath.includes(node)) return;\n      visitedInPath.push(node);\n      if (targetsStr.includes(removeVerFromIdStr(node))) {\n        allPaths.push(visitedInPath);\n        return;\n      }\n      if (visitedInGraph.includes(node)) return;\n      visitedInGraph.push(node);\n      const successors = Array.from(this.successorMap(node).values());\n      successors.forEach((s) => {\n        traverseDFS(s.id, [...visitedInPath], visitedInGraph, allPaths);\n      });\n    };\n\n    let allPaths: string[][] = [];\n    sources.forEach((source) => {\n      traverseDFS(source.toString(), [], [], allPaths);\n    });\n\n    if (through?.length) {\n      allPaths = allPaths.filter((pathWithVer) => {\n        const pathWithoutVer = pathWithVer.map((p) => removeVerFromIdStr(p));\n        return through.every((t) => pathWithoutVer.includes(t.toStringWithoutVersion()));\n      });\n    }\n\n    const sourcesStr = sources.map((s) => s.toString());\n    const filtered = allPaths.filter((path) => {\n      if (path.length < 3) {\n        // if length is 1, the source and target are the same.\n        // if length is 2, the target is a direct dependency of the source. we don't care about it.\n        return false;\n      }\n      const [, firstDep] = path;\n      if (sourcesStr.includes(firstDep)) {\n        // the first item is the source. the second item \"firstDep\" can be a direct dependency of one of the sources.\n        // if this is the case, we have already an exact path without this firstDep.\n        return true;\n      }\n      return true;\n    });\n\n    return filtered.sort((a, b) => a.length - b.length);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this, includeDeps = false): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly() || includeDeps) {\n      return cycles;\n    }\n    const seederIdsStr = this.seederIds.map((id) => id.toString());\n    const cyclesWithSeeders = cycles.filter((cycle) => {\n      return cycle.some((cycleIdStr) => seederIdsStr.includes(cycleIdStr));\n    });\n    return cyclesWithSeeders;\n  }\n\n  buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph {\n    return this.create(graph.nodes, graph.edges);\n  }\n\n  runtimeOnly(componentIds: string[]) {\n    return this.successorsSubgraph(componentIds, {\n      edgeFilter: (edge: DependencyEdge) => edge.attr === 'prod',\n    });\n  }\n\n  getDependenciesInfo(id: ComponentID): DependenciesInfo[] {\n    const dijkstraResults = GraphLib.alg.dijkstra(this.graphLib, id.toString());\n    const dependencies: DependenciesInfo[] = [];\n    Object.keys(dijkstraResults).forEach((idStr) => {\n      const distance = dijkstraResults[idStr].distance;\n      if (distance === Infinity || distance === 0) {\n        // there is no dependency or it's the same component (distance zero)\n        return;\n      }\n      const predecessor = dijkstraResults[idStr].predecessor;\n      const dependencyType = this.edge(predecessor, idStr);\n      dependencies.push({\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        id: this.node(idStr)!.attr,\n        depth: distance,\n        parent: predecessor,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        dependencyType: dependencyType!.attr,\n      });\n    });\n    dependencies.sort((a, b) => a.depth - b.depth);\n    return dependencies;\n  }\n\n  getDependenciesAsObjectTree(idStr: string): Record<string, any> {\n    const depsInfo = this.getDependenciesInfo(ComponentID.fromString(idStr));\n    const populateTreeItems = (id: string, treeItems: Array<{ label: string; nodes?: Array<Record<string, any>> }>) => {\n      const children = depsInfo.filter((depInfo) => depInfo.parent === id);\n      if (!children || children.length === 0) {\n        return;\n      }\n      children.forEach((child) => {\n        const { id: compId } = child;\n        const label = compId.toString();\n        const currentNodes = [];\n        treeItems.push({ label, nodes: currentNodes });\n        populateTreeItems(label, currentNodes);\n      });\n    };\n\n    const currentNodes = [];\n    const tree = { label: idStr, nodes: currentNodes };\n    populateTreeItems(idStr, currentNodes);\n    return tree;\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,aAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,YAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,OAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,MAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAG,UAAA;EAAA,MAAAH,IAAA,GAAAI,sBAAA,CAAAH,OAAA;EAAAE,SAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,QAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,OAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8B,SAAAI,uBAAAE,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAAA,SAAAG,gBAAAH,GAAA,EAAAI,GAAA,EAAAC,KAAA,IAAAD,GAAA,GAAAE,cAAA,CAAAF,GAAA,OAAAA,GAAA,IAAAJ,GAAA,IAAAO,MAAA,CAAAC,cAAA,CAAAR,GAAA,EAAAI,GAAA,IAAAC,KAAA,EAAAA,KAAA,EAAAI,UAAA,QAAAC,YAAA,QAAAC,QAAA,oBAAAX,GAAA,CAAAI,GAAA,IAAAC,KAAA,WAAAL,GAAA;AAAA,SAAAM,eAAAM,CAAA,QAAAC,CAAA,GAAAC,YAAA,CAAAF,CAAA,uCAAAC,CAAA,GAAAA,CAAA,GAAAE,MAAA,CAAAF,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAI,CAAA,2BAAAJ,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAK,CAAA,GAAAL,CAAA,CAAAM,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAJ,CAAA,GAAAI,CAAA,CAAAG,IAAA,CAAAR,CAAA,EAAAI,CAAA,uCAAAH,CAAA,SAAAA,CAAA,YAAAQ,SAAA,yEAAAL,CAAA,GAAAD,MAAA,GAAAO,MAAA,EAAAV,CAAA;AAQvB,MAAMW,gBAAgB,SAASC,cAAK,CAA2B;EAErC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACxB,eAAA;IAAAA,eAAA,oBAFK,EAAE;EAG7B;EAEA,IAAIyB,QAAQA,CAAA,EAAG;IACb,IAAI,CAAC,IAAI,CAACC,SAAS,EAAE;MACnB;MACA,IAAI,CAACA,SAAS,GAAG,KAAIC,mBAAQ,CAACN,KAAK,EAAC,CAAC;MACrC,IAAI,CAACE,KAAK,CAACK,OAAO,CAAEC,IAAI,IAAK;QAC3B,IAAI,CAACH,SAAS,CAACI,OAAO,CAACD,IAAI,CAACE,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;MAC5C,CAAC,CAAC;MACF,IAAI,CAACR,KAAK,CAACI,OAAO,CAAEK,IAAI,IAAK;QAC3B,IAAI,CAACP,SAAS,CAACQ,OAAO,CAACD,IAAI,CAACE,QAAQ,CAACH,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACG,QAAQ,CAACJ,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACI,IAAI,CAAC;MACvF,CAAC,CAAC;IACJ;IACA,OAAO,IAAI,CAACX,SAAS;EACvB;EAEUY,MAAMA,CAACf,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAQ;IAClF,OAAO,IAAIJ,gBAAgB,CAACG,KAAK,EAAEC,KAAK,CAAC;EAC3C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEe,2BAA2BA,CAACC,OAAsB,EAAEC,OAAsB,EAAEC,OAAuB,EAAiB;IAClH,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAME,YAAY,GAAGX,OAAO,CAACO,GAAG,CAAEK,MAAM,IAAK,IAAI,CAACC,UAAU,CAACD,MAAM,CAACpB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAACsB,IAAI,CAAC,CAAC;IACvF,MAAMC,eAAe,GAAG,IAAAC,cAAI,EAACL,YAAY,CAACJ,GAAG,CAAEU,CAAC,IAAKA,CAAC,CAAC1B,EAAE,CAAC,CAAC;IAC3D,MAAM2B,OAAiB,GAAG,EAAE;IAC5BH,eAAe,CAAC3B,OAAO,CAAEG,EAAE,IAAK;MAC9B,MAAM4B,WAAW,GAAGhB,kBAAkB,CAACZ,EAAE,CAAC;MAC1C,IAAIe,UAAU,CAACc,QAAQ,CAACD,WAAW,CAAC,IAAIT,UAAU,CAACU,QAAQ,CAACD,WAAW,CAAC,EAAE;MAC1E,MAAME,aAAa,GAAG,IAAI,CAACR,UAAU,CAACtB,EAAE,CAAC;MACzC,MAAM+B,0BAA0B,GAAGD,aAAa,CAACd,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAACjB,EAAE,CAAC,CAAC;MACrF,IAAI+B,0BAA0B,CAACC,IAAI,CAAEf,CAAC,IAAKE,UAAU,CAACU,QAAQ,CAACZ,CAAC,CAAC,CAAC,EAAEU,OAAO,CAACM,IAAI,CAACjC,EAAE,CAAC;IACtF,CAAC,CAAC;IACF,MAAMkC,YAAY,GAAG,IAAI,CAACC,QAAQ,CAACR,OAAO,CAAC,CAACX,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAAC9B,IAAI,CAAC;IAE9D,IAAI,CAACK,OAAO,EAAE0B,MAAM,EAAE;MACpB,OAAOH,YAAY;IACrB;IAEA,MAAMI,kBAAiC,GAAG,EAAE;IAC5C,MAAMC,UAAU,GAAG5B,OAAO,CAACK,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjEgB,YAAY,CAACrC,OAAO,CAAEG,EAAE,IAAK;MAC3B,MAAMwC,QAAQ,GAAG,IAAI,CAACC,QAAQ,CAACzC,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC,CAACT,KAAK,CAACwB,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAACpC,EAAE,CAAC,CAAC,CAAC;MACtE,MAAM0C,qBAAqB,GAAGF,QAAQ,CAACxB,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAAC,CAAC;MACxE,IAAIsB,UAAU,CAACI,KAAK,CAAEjE,CAAC,IAAKgE,qBAAqB,CAACb,QAAQ,CAACnD,CAAC,CAAC,CAAC,EAAE4D,kBAAkB,CAACL,IAAI,CAACjC,EAAE,CAAC;IAC7F,CAAC,CAAC;IAEF,OAAOsC,kBAAkB;EAC3B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEM,gCAAgCA,CAC9BnC,OAAsB,EACtBC,OAAsB,EACtBC,OAAuB,EACX;IACZ,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMK,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IAEjE,MAAM2B,WAAW,GAAGA,CAClB/C,IAAY,EACZgD,aAAuB,EACvBC,cAAwB,GAAG,EAAE,EAC7BC,QAAoB,KACjB;MACH,IAAIF,aAAa,CAACjB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MAClCgD,aAAa,CAACb,IAAI,CAACnC,IAAI,CAAC;MACxB,IAAIqB,UAAU,CAACU,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;QACjDkD,QAAQ,CAACf,IAAI,CAACa,aAAa,CAAC;QAC5B;MACF;MACA,IAAIC,cAAc,CAAClB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MACnCiD,cAAc,CAACd,IAAI,CAACnC,IAAI,CAAC;MACzB,MAAMwB,UAAU,GAAG2B,KAAK,CAACC,IAAI,CAAC,IAAI,CAACC,YAAY,CAACrD,IAAI,CAAC,CAACsD,MAAM,CAAC,CAAC,CAAC;MAC/D9B,UAAU,CAACzB,OAAO,CAAEoB,CAAC,IAAK;QACxB4B,WAAW,CAAC5B,CAAC,CAACjB,EAAE,EAAE,CAAC,GAAG8C,aAAa,CAAC,EAAEC,cAAc,EAAEC,QAAQ,CAAC;MACjE,CAAC,CAAC;IACJ,CAAC;IAED,IAAIA,QAAoB,GAAG,EAAE;IAC7BvC,OAAO,CAACZ,OAAO,CAAEwB,MAAM,IAAK;MAC1BwB,WAAW,CAACxB,MAAM,CAACpB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE+C,QAAQ,CAAC;IAClD,CAAC,CAAC;IAEF,IAAIrC,OAAO,EAAE0B,MAAM,EAAE;MACnBW,QAAQ,GAAGA,QAAQ,CAACK,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAACtC,GAAG,CAAEwC,CAAC,IAAK5C,kBAAkB,CAAC4C,CAAC,CAAC,CAAC;QACpE,OAAO7C,OAAO,CAACgC,KAAK,CAAEjE,CAAC,IAAK6E,cAAc,CAAC1B,QAAQ,CAACnD,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IACnD,MAAMwD,QAAQ,GAAGT,QAAQ,CAACK,MAAM,CAAEK,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACrB,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAGsB,QAAQ,CAAC,GAAGD,IAAI;MACzB,IAAI3C,UAAU,CAACc,QAAQ,CAAC8B,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOF,QAAQ,CAACG,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACxB,MAAM,GAAGyB,CAAC,CAACzB,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE0B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC,IAAI,CAAC,IAAI,CAACG,wBAAwB,CAAC,CAAC,IAAIF,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAME,YAAY,GAAG,IAAI,CAACC,SAAS,CAACrD,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAMqE,iBAAiB,GAAGJ,MAAM,CAACb,MAAM,CAAEkB,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKL,YAAY,CAACvC,QAAQ,CAAC4C,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOH,iBAAiB;EAC1B;EAEAI,mBAAmBA,CAACV,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAACzD,MAAM,CAACyD,KAAK,CAACxE,KAAK,EAAEwE,KAAK,CAACvE,KAAK,CAAC;EAC9C;EAEAkF,WAAWA,CAACzC,YAAsB,EAAE;IAClC,OAAO,IAAI,CAAC0C,kBAAkB,CAAC1C,YAAY,EAAE;MAC3C2C,UAAU,EAAG3E,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEAwE,mBAAmBA,CAAC9E,EAAe,EAAsB;IACvD,MAAM+E,eAAe,GAAGnF,mBAAQ,CAACoF,GAAG,CAACC,QAAQ,CAAC,IAAI,CAACvF,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMiF,YAAgC,GAAG,EAAE;IAC3C7G,MAAM,CAAC8G,IAAI,CAACJ,eAAe,CAAC,CAAClF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAMuE,QAAQ,GAAGL,eAAe,CAAClE,KAAK,CAAC,CAACuE,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAAClE,KAAK,CAAC,CAACyE,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAACrF,IAAI,CAACoF,WAAW,EAAEzE,KAAK,CAAC;MACpDqE,YAAY,CAACjD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BkF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEjF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACF4E,YAAY,CAACtB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC2B,KAAK,GAAG1B,CAAC,CAAC0B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAAC7E,KAAa,EAAuB;IAC9D,MAAM8E,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAAChF,KAAK,CAAC,CAAC;IACxE,MAAMiF,iBAAiB,GAAGA,CAAC9F,EAAU,EAAE+F,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAKzF,EAAE,CAAC;MACpE,IAAI,CAACgG,QAAQ,IAAIA,QAAQ,CAAC3D,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACA2D,QAAQ,CAACnG,OAAO,CAAEqG,KAAK,IAAK;QAC1B,MAAM;UAAElG,EAAE,EAAEmG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAAClG,QAAQ,CAAC,CAAC;QAC/B,MAAMoG,YAAY,GAAG,EAAE;QACvBN,SAAS,CAAC9D,IAAI,CAAC;UAAEmE,KAAK;UAAE5G,KAAK,EAAE6G;QAAa,CAAC,CAAC;QAC9CP,iBAAiB,CAACM,KAAK,EAAEC,YAAY,CAAC;MACxC,CAAC,CAAC;IACJ,CAAC;IAED,MAAMA,YAAY,GAAG,EAAE;IACvB,MAAMC,IAAI,GAAG;MAAEF,KAAK,EAAEvF,KAAK;MAAErB,KAAK,EAAE6G;IAAa,CAAC;IAClDP,iBAAiB,CAACjF,KAAK,EAAEwF,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQnC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAAChC,MAAM;EAC9B;AACF;AAACkE,OAAA,CAAAlH,gBAAA,GAAAA,gBAAA"}

package/dist/index.d.ts

@@ -8,7 +8,7 @@ export { GraphFilters, styles as graphPageStyles } from './ui/graph-page';
 export { EdgeModel, GraphModel, NodeModel, useGraph, useGraphQuery } from './ui/query';
 export { styles as componentNodeStyles, root, defaultNode, external } from './ui/component-node';
 export type { RawGraph } from './ui/query';
-export type { CompIdGraph, DepEdgeType } from './component-id-graph';
+export type { CompIdGraph, DepEdgeType, ComponentIdGraph } from './component-id-graph';
 export type { ComponentGraph } from './component-graph';
 export type { ComponentWidget, ComponentWidgetProps, ComponentWidgetSlot, GraphUI } from './graph.ui.runtime';
 export { EdgeType } from './edge-type';

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"names":["_dependenciesCompare","data","require","_dependency","_duplicateDependency","_graph","_objectListToGraph","_dependenciesGraph","_graphPage","_query","_componentNode","_edgeType"],"sources":["index.ts"],"sourcesContent":["export { DependenciesCompare } from './ui/dependencies-compare';\nexport { Dependency } from './model/dependency';\nexport { DuplicateDependency } from './duplicate-dependency';\nexport { GraphAspect as default, GraphAspect } from './graph.aspect';\nexport { IdGraph, objectListToGraph, bitObjectListToGraph } from './object-list-to-graph';\nexport {\n  calcElements,\n  calcLayout,\n  calcMinimapColors,\n  depTypeToClass,\n  depTypeToLabel,\n  styles as dependenciesGraphStyles,\n} from './ui/dependencies-graph';\nexport { GraphFilters, styles as graphPageStyles } from './ui/graph-page';\nexport { EdgeModel, GraphModel, NodeModel, useGraph, useGraphQuery } from './ui/query';\nexport { styles as componentNodeStyles, root, defaultNode, external } from './ui/component-node';\nexport type { RawGraph } from './ui/query';\nexport type { CompIdGraph, DepEdgeType } from './component-id-graph';\nexport type { ComponentGraph } from './component-graph';\nexport type { ComponentWidget, ComponentWidgetProps, ComponentWidgetSlot, GraphUI } from './graph.ui.runtime';\nexport { EdgeType } from './edge-type';\nexport type { GraphBuilder } from './graph-builder';\nexport type { GraphFilter } from './model/graph-filters';\nexport type { GraphMain } from './graph.main.runtime';\nexport type { VersionSubgraph } from './duplicate-dependency';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,qBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,oBAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,YAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,WAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,qBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,oBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,OAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,MAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,mBAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,kBAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,mBAAA;EAAA,MAAAN,IAAA,GAAAC,OAAA;EAAAK,kBAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA,SAAAO,WAAA;EAAA,MAAAP,IAAA,GAAAC,OAAA;EAAAM,UAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,OAAA;EAAA,MAAAR,IAAA,GAAAC,OAAA;EAAAO,MAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,eAAA;EAAA,MAAAT,IAAA,GAAAC,OAAA;EAAAQ,cAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKA,SAAAU,UAAA;EAAA,MAAAV,IAAA,GAAAC,OAAA;EAAAS,SAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA"}
+{"version":3,"names":["_dependenciesCompare","data","require","_dependency","_duplicateDependency","_graph","_objectListToGraph","_dependenciesGraph","_graphPage","_query","_componentNode","_edgeType"],"sources":["index.ts"],"sourcesContent":["export { DependenciesCompare } from './ui/dependencies-compare';\nexport { Dependency } from './model/dependency';\nexport { DuplicateDependency } from './duplicate-dependency';\nexport { GraphAspect as default, GraphAspect } from './graph.aspect';\nexport { IdGraph, objectListToGraph, bitObjectListToGraph } from './object-list-to-graph';\nexport {\n  calcElements,\n  calcLayout,\n  calcMinimapColors,\n  depTypeToClass,\n  depTypeToLabel,\n  styles as dependenciesGraphStyles,\n} from './ui/dependencies-graph';\nexport { GraphFilters, styles as graphPageStyles } from './ui/graph-page';\nexport { EdgeModel, GraphModel, NodeModel, useGraph, useGraphQuery } from './ui/query';\nexport { styles as componentNodeStyles, root, defaultNode, external } from './ui/component-node';\nexport type { RawGraph } from './ui/query';\nexport type { CompIdGraph, DepEdgeType, ComponentIdGraph } from './component-id-graph';\nexport type { ComponentGraph } from './component-graph';\nexport type { ComponentWidget, ComponentWidgetProps, ComponentWidgetSlot, GraphUI } from './graph.ui.runtime';\nexport { EdgeType } from './edge-type';\nexport type { GraphBuilder } from './graph-builder';\nexport type { GraphFilter } from './model/graph-filters';\nexport type { GraphMain } from './graph.main.runtime';\nexport type { VersionSubgraph } from './duplicate-dependency';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,qBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,oBAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,YAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,WAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,qBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,oBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,OAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,MAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,mBAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,kBAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,mBAAA;EAAA,MAAAN,IAAA,GAAAC,OAAA;EAAAK,kBAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA,SAAAO,WAAA;EAAA,MAAAP,IAAA,GAAAC,OAAA;EAAAM,UAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,OAAA;EAAA,MAAAR,IAAA,GAAAC,OAAA;EAAAO,MAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,eAAA;EAAA,MAAAT,IAAA,GAAAC,OAAA;EAAAQ,cAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKA,SAAAU,UAAA;EAAA,MAAAV,IAAA,GAAAC,OAAA;EAAAS,SAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA"}

package/dist/preview-1708259356169.js

@@ -0,0 +1,7 @@
+import * as compositions_0 from '/Users/giladshoham/Library/Caches/Bit/capsules/root/95c2f3515392701f327019ce43202e7563a02128/teambit.component_graph@1.0.168/dist/graph.composition.js';
+import * as overview_0 from '/Users/giladshoham/Library/Caches/Bit/capsules/root/95c2f3515392701f327019ce43202e7563a02128/teambit.component_graph@1.0.168/dist/graph.docs.md';
+
+export const compositions = [compositions_0];
+export const overview = [overview_0];
+
+export const compositions_metadata = {"compositions":[{"displayName":"Logo","identifier":"Logo"}]};

package/package.json

@@ -1,24 +1,24 @@
 {
   "name": "@teambit/graph",
-  "version": "1.0.166",
+  "version": "1.0.168",
   "homepage": "https://bit.cloud/teambit/component/graph",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.166"
+    "version": "1.0.168"
   },
   "dependencies": {
+    "graphlib": "2.1.8",
     "lodash": "4.17.21",
     "chalk": "2.4.2",
-    "graphlib": "2.1.8",
     "graphql-tag": "2.12.1",
     "classnames": "2.2.6",
     "react-flow-renderer": "8.3.7",
     "semver": "7.5.2",
     "dagre": "0.8.5",
-    "@teambit/graph.cleargraph": "0.0.8",
     "@teambit/component-id": "1.2.0",
+    "@teambit/graph.cleargraph": "0.0.8",
     "@teambit/harmony": "0.4.6",
     "@teambit/component.ui.component-compare.models.component-compare-change-type": "0.0.7",
     "@teambit/base-ui.routing.nav-link": "1.0.0",
@@ -35,20 +35,20 @@
     "@teambit/ui-foundation.ui.full-loader": "0.0.500",
     "@teambit/ui-foundation.ui.hooks.use-data-query": "0.0.505",
     "@teambit/ui-foundation.ui.react-router.use-query": "0.0.501",
-    "@teambit/component": "1.0.166",
+    "@teambit/component": "1.0.168",
     "@teambit/cli": "0.0.851",
     "@teambit/component.ui.component-compare.models.component-compare-props": "0.0.103",
-    "@teambit/graphql": "1.0.166",
+    "@teambit/graphql": "1.0.168",
     "@teambit/logger": "0.0.944",
-    "@teambit/component-compare": "1.0.166",
-    "@teambit/ui": "1.0.166",
+    "@teambit/component-compare": "1.0.168",
+    "@teambit/ui": "1.0.168",
     "@teambit/component.modules.component-url": "0.0.167",
     "@teambit/envs.ui.env-icon": "0.0.505",
     "@teambit/component.ui.component-compare.context": "0.0.118"
   },
   "devDependencies": {
-    "@types/lodash": "4.14.165",
     "@types/graphlib": "2.1.7",
+    "@types/lodash": "4.14.165",
     "@types/classnames": "2.2.11",
     "@types/semver": "7.3.4",
     "@types/dagre": "0.7.44",

package/dist/preview-1707880563763.js

@@ -1,7 +0,0 @@
-import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.166/dist/graph.composition.js';
-import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.166/dist/graph.docs.md';
-
-export const compositions = [compositions_0];
-export const overview = [overview_0];
-
-export const compositions_metadata = {"compositions":[{"displayName":"Logo","identifier":"Logo"}]};