@teambit/graph 1.0.482 → 1.0.484

package/artifacts/__bit_junit.xml

@@ -1,4 +1,4 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <testsuites tests="0" failures="0" errors="0" skipped="0">
-  <testsuite name="teambit.component/graph@1.0.482" tests="0" failures="0" errors="0" skipped="0"/>
+  <testsuite name="teambit.component/graph@1.0.484" tests="0" failures="0" errors="0" skipped="0"/>
 </testsuites>

package/artifacts/preview/teambit_component_graph-preview.js

@@ -1 +1 @@
-!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports["teambit.component/graph-preview"]=t():e["teambit.component/graph-preview"]=t()}(self,(()=>(()=>{"use strict";var e={6028:(e,t,o)=>{var n={id:"teambit.component/graph@1.0.482",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function r(){const e=i(o(1594));return r=function(){return e},e}function i(e){return e&&e.__esModule?e:{default:e}}Object.defineProperty(t,"__esModule",{value:!0}),t.Logo=void 0,r.__bit_component=n,i.__bit_component=n;const a=()=>r().default.createElement("div",{style:{height:"100%",display:"flex",justifyContent:"center"}},r().default.createElement("img",{style:{width:70},src:"https://static.bit.dev/extensions-icons/graph.svg"}));a.__bit_component=n,t.Logo=a},1594:e=>{e.exports=React}},t={};function o(n){var r=t[n];if(void 0!==r)return r.exports;var i=t[n]={exports:{}};return e[n](i,i.exports,o),i.exports}o.d=(e,t)=>{for(var n in t)o.o(t,n)&&!o.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:t[n]})},o.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),o.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var n={};o.r(n),o.d(n,{compositions:()=>f,compositions_metadata:()=>v,overview:()=>m});var r={};o.r(r),o.d(r,{default:()=>d});var i=o(6028);o(1594);const a=MdxJsReact,p=TeambitMdxUiMdxScopeContext;var c=["components"];function s(){return s=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var o=arguments[t];for(var n in o)({}).hasOwnProperty.call(o,n)&&(e[n]=o[n])}return e},s.apply(null,arguments)}var u={},l="wrapper";function d(e){var t=e.components,o=function(e,t){if(null==e)return{};var o,n,r=function(e,t){if(null==e)return{};var o={};for(var n in e)if({}.hasOwnProperty.call(e,n)){if(t.includes(n))continue;o[n]=e[n]}return o}(e,t);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(n=0;n<i.length;n++)o=i[n],t.includes(o)||{}.propertyIsEnumerable.call(e,o)&&(r[o]=e[o])}return r}(e,c);return(0,a.mdx)(l,s({},u,o,{components:t,mdxType:"MDXLayout"}),(0,a.mdx)(p.MDXScopeProvider,{components:{},mdxType:"MDXScopeProvider"}))}d.isMDXComponent=!0;const f=[i],m=[r],v={compositions:[{displayName:"Logo",identifier:"Logo"}]};return n})()));
+!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports["teambit.component/graph-preview"]=t():e["teambit.component/graph-preview"]=t()}(self,(()=>(()=>{"use strict";var e={934:(e,t,o)=>{var n={id:"teambit.component/graph@1.0.484",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function r(){const e=i(o(1594));return r=function(){return e},e}function i(e){return e&&e.__esModule?e:{default:e}}Object.defineProperty(t,"__esModule",{value:!0}),t.Logo=void 0,r.__bit_component=n,i.__bit_component=n;const a=()=>r().default.createElement("div",{style:{height:"100%",display:"flex",justifyContent:"center"}},r().default.createElement("img",{style:{width:70},src:"https://static.bit.dev/extensions-icons/graph.svg"}));a.__bit_component=n,t.Logo=a},1594:e=>{e.exports=React}},t={};function o(n){var r=t[n];if(void 0!==r)return r.exports;var i=t[n]={exports:{}};return e[n](i,i.exports,o),i.exports}o.d=(e,t)=>{for(var n in t)o.o(t,n)&&!o.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:t[n]})},o.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),o.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var n={};o.r(n),o.d(n,{compositions:()=>f,compositions_metadata:()=>v,overview:()=>m});var r={};o.r(r),o.d(r,{default:()=>d});var i=o(934);o(1594);const a=MdxJsReact,p=TeambitMdxUiMdxScopeContext;var c=["components"];function s(){return s=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var o=arguments[t];for(var n in o)({}).hasOwnProperty.call(o,n)&&(e[n]=o[n])}return e},s.apply(null,arguments)}var u={},l="wrapper";function d(e){var t=e.components,o=function(e,t){if(null==e)return{};var o,n,r=function(e,t){if(null==e)return{};var o={};for(var n in e)if({}.hasOwnProperty.call(e,n)){if(t.includes(n))continue;o[n]=e[n]}return o}(e,t);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(n=0;n<i.length;n++)o=i[n],t.includes(o)||{}.propertyIsEnumerable.call(e,o)&&(r[o]=e[o])}return r}(e,c);return(0,a.mdx)(l,s({},u,o,{components:t,mdxType:"MDXLayout"}),(0,a.mdx)(p.MDXScopeProvider,{components:{},mdxType:"MDXScopeProvider"}))}d.isMDXComponent=!0;const f=[i],m=[r],v={compositions:[{displayName:"Logo",identifier:"Logo"}]};return n})()));

package/artifacts/schema.json

@@ -566,7 +566,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -2995,7 +2995,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -3490,7 +3490,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -3616,7 +3616,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -5073,7 +5073,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -7506,7 +7506,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -8084,7 +8084,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -8232,7 +8232,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.482"
+                    "version": "1.0.484"
                   },
                   "_scope": "teambit.component"
                 }
@@ -9819,7 +9819,7 @@
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.482"
+    "version": "1.0.484"
   },
   "taggedModuleExports": []
 }

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

@@ -1,6 +1,6 @@
 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 type { DependenciesInfo } from '@teambit/legacy.dependency-graph';
 import GraphLib from 'graphlib';
 export type DepEdgeType = 'prod' | 'dev' | 'ext' | 'peer';
 type ComponentIdNode = Node<ComponentID>;

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

@@ -1 +1 @@
-{"version":3,"names":["_componentId","data","require","_graph","_graphlib","_interopRequireDefault","_lodash","e","__esModule","default","_defineProperty","r","t","_toPropertyKey","Object","defineProperty","value","enumerable","configurable","writable","i","_toPrimitive","Symbol","toPrimitive","call","TypeError","String","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","findAllPathsBFS","start","end","paths","visited","Set","queue","path","shift","add","outEdges","successor","has","allPaths","filter","pathWithVer","pathWithoutVer","p","filtered","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","cycle","reverse","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","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' | 'peer';\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\n    const findAllPathsBFS = (start: string[], end: string[]): string[][] => {\n      const paths: string[][] = [];\n      const visited = new Set<string>();\n      const queue: { node: string; path: string[] }[] = [];\n      start.forEach((s) => queue.push({ node: s, path: [s] }));\n      while (queue.length) {\n        const { node, path } = queue.shift()!;\n        if (end.includes(removeVerFromIdStr(node))) {\n          paths.push([...path]);\n        } else {\n          visited.add(node);\n          const successors = this.outEdges(node).map((e) => e.targetId);\n          for (const successor of successors) {\n            if (!visited.has(successor)) {\n              queue.push({ node: successor, path: [...path, successor] });\n            }\n          }\n        }\n      }\n      return paths;\n    };\n\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const sourcesStr = sources.map((s) => s.toString());\n\n    let allPaths = findAllPathsBFS(sourcesStr, targetsStr);\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 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    // reverse the order to show a more intuitive cycle order. from the dependent to the dependency.\n    cycles.forEach((cycle) => cycle.reverse());\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,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAAA,SAAAG,gBAAAH,CAAA,EAAAI,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAE,cAAA,CAAAF,CAAA,MAAAJ,CAAA,GAAAO,MAAA,CAAAC,cAAA,CAAAR,CAAA,EAAAI,CAAA,IAAAK,KAAA,EAAAJ,CAAA,EAAAK,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAZ,CAAA,CAAAI,CAAA,IAAAC,CAAA,EAAAL,CAAA;AAAA,SAAAM,eAAAD,CAAA,QAAAQ,CAAA,GAAAC,YAAA,CAAAT,CAAA,uCAAAQ,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAC,aAAAT,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAL,CAAA,GAAAK,CAAA,CAAAU,MAAA,CAAAC,WAAA,kBAAAhB,CAAA,QAAAa,CAAA,GAAAb,CAAA,CAAAiB,IAAA,CAAAZ,CAAA,EAAAD,CAAA,uCAAAS,CAAA,SAAAA,CAAA,YAAAK,SAAA,yEAAAd,CAAA,GAAAe,MAAA,GAAAC,MAAA,EAAAf,CAAA;AAQvB,MAAMgB,gBAAgB,SAASC,cAAK,CAA2B;EAErC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACtB,eAAA;IAAAA,eAAA,oBAFK,EAAE;EAG7B;EAEA,IAAIuB,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,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,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,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,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,CAAEtE,CAAC,IAAKqE,qBAAqB,CAACb,QAAQ,CAACxD,CAAC,CAAC,CAAC,EAAEiE,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;IAEjE,MAAM+B,eAAe,GAAGA,CAACC,KAAe,EAAEC,GAAa,KAAiB;MACtE,MAAMC,KAAiB,GAAG,EAAE;MAC5B,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAS,CAAC;MACjC,MAAMC,KAAyC,GAAG,EAAE;MACpDL,KAAK,CAACjD,OAAO,CAAEoB,CAAC,IAAKkC,KAAK,CAAClB,IAAI,CAAC;QAAEnC,IAAI,EAAEmB,CAAC;QAAEmC,IAAI,EAAE,CAACnC,CAAC;MAAE,CAAC,CAAC,CAAC;MACxD,OAAOkC,KAAK,CAACd,MAAM,EAAE;QACnB,MAAM;UAAEvC,IAAI;UAAEsD;QAAK,CAAC,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAE;QACrC,IAAIN,GAAG,CAAClB,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;UAC1CkD,KAAK,CAACf,IAAI,CAAC,CAAC,GAAGmB,IAAI,CAAC,CAAC;QACvB,CAAC,MAAM;UACLH,OAAO,CAACK,GAAG,CAACxD,IAAI,CAAC;UACjB,MAAMwB,UAAU,GAAG,IAAI,CAACiC,QAAQ,CAACzD,IAAI,CAAC,CAACkB,GAAG,CAAEhD,CAAC,IAAKA,CAAC,CAACqC,QAAQ,CAAC;UAC7D,KAAK,MAAMmD,SAAS,IAAIlC,UAAU,EAAE;YAClC,IAAI,CAAC2B,OAAO,CAACQ,GAAG,CAACD,SAAS,CAAC,EAAE;cAC3BL,KAAK,CAAClB,IAAI,CAAC;gBAAEnC,IAAI,EAAE0D,SAAS;gBAAEJ,IAAI,EAAE,CAAC,GAAGA,IAAI,EAAEI,SAAS;cAAE,CAAC,CAAC;YAC7D;UACF;QACF;MACF;MACA,OAAOR,KAAK;IACd,CAAC;IAED,MAAM7B,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IAEnD,IAAIyD,QAAQ,GAAGb,eAAe,CAAC9B,UAAU,EAAEI,UAAU,CAAC;IAEtD,IAAIR,OAAO,EAAE0B,MAAM,EAAE;MACnBqB,QAAQ,GAAGA,QAAQ,CAACC,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAAC5C,GAAG,CAAE8C,CAAC,IAAKlD,kBAAkB,CAACkD,CAAC,CAAC,CAAC;QACpE,OAAOnD,OAAO,CAACgC,KAAK,CAAEtE,CAAC,IAAKwF,cAAc,CAAChC,QAAQ,CAACxD,CAAC,CAAC6C,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAM6C,QAAQ,GAAGL,QAAQ,CAACC,MAAM,CAAEP,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACf,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAG2B,QAAQ,CAAC,GAAGZ,IAAI;MACzB,IAAIrC,UAAU,CAACc,QAAQ,CAACmC,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOD,QAAQ,CAACE,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC7B,MAAM,GAAG8B,CAAC,CAAC9B,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE+B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC;IACAE,MAAM,CAAC1E,OAAO,CAAE2E,KAAK,IAAKA,KAAK,CAACC,OAAO,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI,CAACC,wBAAwB,CAAC,CAAC,IAAIJ,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAMI,YAAY,GAAG,IAAI,CAACC,SAAS,CAAC5D,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAM4E,iBAAiB,GAAGN,MAAM,CAACZ,MAAM,CAAEa,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACM,IAAI,CAAEC,UAAU,IAAKJ,YAAY,CAAC9C,QAAQ,CAACkD,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOF,iBAAiB;EAC1B;EAEAG,mBAAmBA,CAACX,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAAC9D,MAAM,CAAC8D,KAAK,CAAC7E,KAAK,EAAE6E,KAAK,CAAC5E,KAAK,CAAC;EAC9C;EAEAwF,WAAWA,CAAC/C,YAAsB,EAAE;IAClC,OAAO,IAAI,CAACgD,kBAAkB,CAAChD,YAAY,EAAE;MAC3CiD,UAAU,EAAGjF,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEA8E,mBAAmBA,CAACpF,EAAe,EAAsB;IACvD,MAAMqF,eAAe,GAAGzF,mBAAQ,CAAC0F,GAAG,CAACC,QAAQ,CAAC,IAAI,CAAC7F,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMuF,YAAgC,GAAG,EAAE;IAC3CjH,MAAM,CAACkH,IAAI,CAACJ,eAAe,CAAC,CAACxF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAM6E,QAAQ,GAAGL,eAAe,CAACxE,KAAK,CAAC,CAAC6E,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAACxE,KAAK,CAAC,CAAC+E,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAAC3F,IAAI,CAAC0F,WAAW,EAAE/E,KAAK,CAAC;MACpD2E,YAAY,CAACvD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BwF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEvF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACFkF,YAAY,CAACvB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC4B,KAAK,GAAG3B,CAAC,CAAC2B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAACnF,KAAa,EAAuB;IAC9D,MAAMoF,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAACtF,KAAK,CAAC,CAAC;IACxE,MAAMuF,iBAAiB,GAAGA,CAACpG,EAAU,EAAEqG,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAK/F,EAAE,CAAC;MACpE,IAAI,CAACsG,QAAQ,IAAIA,QAAQ,CAACjE,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACAiE,QAAQ,CAACzG,OAAO,CAAE2G,KAAK,IAAK;QAC1B,MAAM;UAAExG,EAAE,EAAEyG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAACxG,QAAQ,CAAC,CAAC;QAC/B,MAAM0G,YAAY,GAAG,EAAE;QACvBN,SAAS,CAACpE,IAAI,CAAC;UAAEyE,KAAK;UAAElH,KAAK,EAAEmH;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,EAAE7F,KAAK;MAAErB,KAAK,EAAEmH;IAAa,CAAC;IAClDP,iBAAiB,CAACvF,KAAK,EAAE8F,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQlC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACvC,MAAM;EAC9B;AACF;AAACwE,OAAA,CAAAxH,gBAAA,GAAAA,gBAAA","ignoreList":[]}
+{"version":3,"names":["_componentId","data","require","_graph","_graphlib","_interopRequireDefault","_lodash","e","__esModule","default","_defineProperty","r","t","_toPropertyKey","Object","defineProperty","value","enumerable","configurable","writable","i","_toPrimitive","Symbol","toPrimitive","call","TypeError","String","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","findAllPathsBFS","start","end","paths","visited","Set","queue","path","shift","add","outEdges","successor","has","allPaths","filter","pathWithVer","pathWithoutVer","p","filtered","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","cycle","reverse","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","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.dependency-graph';\nimport GraphLib from 'graphlib';\nimport { uniq } from 'lodash';\n\nexport type DepEdgeType = 'prod' | 'dev' | 'ext' | 'peer';\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\n    const findAllPathsBFS = (start: string[], end: string[]): string[][] => {\n      const paths: string[][] = [];\n      const visited = new Set<string>();\n      const queue: { node: string; path: string[] }[] = [];\n      start.forEach((s) => queue.push({ node: s, path: [s] }));\n      while (queue.length) {\n        const { node, path } = queue.shift()!;\n        if (end.includes(removeVerFromIdStr(node))) {\n          paths.push([...path]);\n        } else {\n          visited.add(node);\n          const successors = this.outEdges(node).map((e) => e.targetId);\n          for (const successor of successors) {\n            if (!visited.has(successor)) {\n              queue.push({ node: successor, path: [...path, successor] });\n            }\n          }\n        }\n      }\n      return paths;\n    };\n\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const sourcesStr = sources.map((s) => s.toString());\n\n    let allPaths = findAllPathsBFS(sourcesStr, targetsStr);\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 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    // reverse the order to show a more intuitive cycle order. from the dependent to the dependency.\n    cycles.forEach((cycle) => cycle.reverse());\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,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAAA,SAAAG,gBAAAH,CAAA,EAAAI,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAE,cAAA,CAAAF,CAAA,MAAAJ,CAAA,GAAAO,MAAA,CAAAC,cAAA,CAAAR,CAAA,EAAAI,CAAA,IAAAK,KAAA,EAAAJ,CAAA,EAAAK,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAZ,CAAA,CAAAI,CAAA,IAAAC,CAAA,EAAAL,CAAA;AAAA,SAAAM,eAAAD,CAAA,QAAAQ,CAAA,GAAAC,YAAA,CAAAT,CAAA,uCAAAQ,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAC,aAAAT,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAL,CAAA,GAAAK,CAAA,CAAAU,MAAA,CAAAC,WAAA,kBAAAhB,CAAA,QAAAa,CAAA,GAAAb,CAAA,CAAAiB,IAAA,CAAAZ,CAAA,EAAAD,CAAA,uCAAAS,CAAA,SAAAA,CAAA,YAAAK,SAAA,yEAAAd,CAAA,GAAAe,MAAA,GAAAC,MAAA,EAAAf,CAAA;AAQvB,MAAMgB,gBAAgB,SAASC,cAAK,CAA2B;EAErC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACtB,eAAA;IAAAA,eAAA,oBAFK,EAAE;EAG7B;EAEA,IAAIuB,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,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,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,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,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,CAAEtE,CAAC,IAAKqE,qBAAqB,CAACb,QAAQ,CAACxD,CAAC,CAAC,CAAC,EAAEiE,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;IAEjE,MAAM+B,eAAe,GAAGA,CAACC,KAAe,EAAEC,GAAa,KAAiB;MACtE,MAAMC,KAAiB,GAAG,EAAE;MAC5B,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAS,CAAC;MACjC,MAAMC,KAAyC,GAAG,EAAE;MACpDL,KAAK,CAACjD,OAAO,CAAEoB,CAAC,IAAKkC,KAAK,CAAClB,IAAI,CAAC;QAAEnC,IAAI,EAAEmB,CAAC;QAAEmC,IAAI,EAAE,CAACnC,CAAC;MAAE,CAAC,CAAC,CAAC;MACxD,OAAOkC,KAAK,CAACd,MAAM,EAAE;QACnB,MAAM;UAAEvC,IAAI;UAAEsD;QAAK,CAAC,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAE;QACrC,IAAIN,GAAG,CAAClB,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;UAC1CkD,KAAK,CAACf,IAAI,CAAC,CAAC,GAAGmB,IAAI,CAAC,CAAC;QACvB,CAAC,MAAM;UACLH,OAAO,CAACK,GAAG,CAACxD,IAAI,CAAC;UACjB,MAAMwB,UAAU,GAAG,IAAI,CAACiC,QAAQ,CAACzD,IAAI,CAAC,CAACkB,GAAG,CAAEhD,CAAC,IAAKA,CAAC,CAACqC,QAAQ,CAAC;UAC7D,KAAK,MAAMmD,SAAS,IAAIlC,UAAU,EAAE;YAClC,IAAI,CAAC2B,OAAO,CAACQ,GAAG,CAACD,SAAS,CAAC,EAAE;cAC3BL,KAAK,CAAClB,IAAI,CAAC;gBAAEnC,IAAI,EAAE0D,SAAS;gBAAEJ,IAAI,EAAE,CAAC,GAAGA,IAAI,EAAEI,SAAS;cAAE,CAAC,CAAC;YAC7D;UACF;QACF;MACF;MACA,OAAOR,KAAK;IACd,CAAC;IAED,MAAM7B,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAE3C,CAAC,IAAKA,CAAC,CAAC6C,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IAEnD,IAAIyD,QAAQ,GAAGb,eAAe,CAAC9B,UAAU,EAAEI,UAAU,CAAC;IAEtD,IAAIR,OAAO,EAAE0B,MAAM,EAAE;MACnBqB,QAAQ,GAAGA,QAAQ,CAACC,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAAC5C,GAAG,CAAE8C,CAAC,IAAKlD,kBAAkB,CAACkD,CAAC,CAAC,CAAC;QACpE,OAAOnD,OAAO,CAACgC,KAAK,CAAEtE,CAAC,IAAKwF,cAAc,CAAChC,QAAQ,CAACxD,CAAC,CAAC6C,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAM6C,QAAQ,GAAGL,QAAQ,CAACC,MAAM,CAAEP,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACf,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAG2B,QAAQ,CAAC,GAAGZ,IAAI;MACzB,IAAIrC,UAAU,CAACc,QAAQ,CAACmC,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOD,QAAQ,CAACE,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC7B,MAAM,GAAG8B,CAAC,CAAC9B,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE+B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC;IACAE,MAAM,CAAC1E,OAAO,CAAE2E,KAAK,IAAKA,KAAK,CAACC,OAAO,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI,CAACC,wBAAwB,CAAC,CAAC,IAAIJ,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAMI,YAAY,GAAG,IAAI,CAACC,SAAS,CAAC5D,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAM4E,iBAAiB,GAAGN,MAAM,CAACZ,MAAM,CAAEa,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACM,IAAI,CAAEC,UAAU,IAAKJ,YAAY,CAAC9C,QAAQ,CAACkD,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOF,iBAAiB;EAC1B;EAEAG,mBAAmBA,CAACX,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAAC9D,MAAM,CAAC8D,KAAK,CAAC7E,KAAK,EAAE6E,KAAK,CAAC5E,KAAK,CAAC;EAC9C;EAEAwF,WAAWA,CAAC/C,YAAsB,EAAE;IAClC,OAAO,IAAI,CAACgD,kBAAkB,CAAChD,YAAY,EAAE;MAC3CiD,UAAU,EAAGjF,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEA8E,mBAAmBA,CAACpF,EAAe,EAAsB;IACvD,MAAMqF,eAAe,GAAGzF,mBAAQ,CAAC0F,GAAG,CAACC,QAAQ,CAAC,IAAI,CAAC7F,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMuF,YAAgC,GAAG,EAAE;IAC3CjH,MAAM,CAACkH,IAAI,CAACJ,eAAe,CAAC,CAACxF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAM6E,QAAQ,GAAGL,eAAe,CAACxE,KAAK,CAAC,CAAC6E,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAACxE,KAAK,CAAC,CAAC+E,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAAC3F,IAAI,CAAC0F,WAAW,EAAE/E,KAAK,CAAC;MACpD2E,YAAY,CAACvD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BwF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEvF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACFkF,YAAY,CAACvB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC4B,KAAK,GAAG3B,CAAC,CAAC2B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAACnF,KAAa,EAAuB;IAC9D,MAAMoF,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAACtF,KAAK,CAAC,CAAC;IACxE,MAAMuF,iBAAiB,GAAGA,CAACpG,EAAU,EAAEqG,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAK/F,EAAE,CAAC;MACpE,IAAI,CAACsG,QAAQ,IAAIA,QAAQ,CAACjE,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACAiE,QAAQ,CAACzG,OAAO,CAAE2G,KAAK,IAAK;QAC1B,MAAM;UAAExG,EAAE,EAAEyG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAACxG,QAAQ,CAAC,CAAC;QAC/B,MAAM0G,YAAY,GAAG,EAAE;QACvBN,SAAS,CAACpE,IAAI,CAAC;UAAEyE,KAAK;UAAElH,KAAK,EAAEmH;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,EAAE7F,KAAK;MAAErB,KAAK,EAAEmH;IAAa,CAAC;IAClDP,iBAAiB,CAACvF,KAAK,EAAE8F,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQlC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACvC,MAAM;EAC9B;AACF;AAACwE,OAAA,CAAAxH,gBAAA,GAAAA,gBAAA","ignoreList":[]}

package/dist/graph-cmd.js

@@ -46,13 +46,6 @@ function _toolboxString() {
   };
   return data;
 }
-function _vizgraph() {
-  const data = _interopRequireDefault(require("@teambit/legacy/dist/scope/graph/vizgraph"));
-  _vizgraph = function () {
-    return data;
-  };
-  return data;
-}
 function _consumer() {
   const data = require("@teambit/legacy/dist/consumer");
   _consumer = function () {
@@ -60,9 +53,9 @@ function _consumer() {
   };
   return data;
 }
-function _scopeGraph() {
-  const data = _interopRequireDefault(require("@teambit/legacy/dist/scope/graph/scope-graph"));
-  _scopeGraph = function () {
+function _legacy() {
+  const data = require("@teambit/legacy.dependency-graph");
+  _legacy = function () {
     return data;
   };
   return data;
@@ -110,7 +103,7 @@ class GraphCmd {
     const config = {};
     // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!
     if (layout) config.layout = layout;
-    const visualDependencyGraph = await _vizgraph().default.loadFromGraphlib(graph, config);
+    const visualDependencyGraph = await _legacy().VisualDependencyGraph.loadFromGraphlib(graph, config);
     image = image || path().join(_os().default.tmpdir(), `${(0, _toolboxString().generateRandomStr)()}.png`);
     const result = await visualDependencyGraph.image(image);
     return _chalk().default.green(`image created at ${result}`);
@@ -141,12 +134,12 @@ class GraphCmd {
     }
     const onlyLatest = !allVersions;
     // @ts-ignore consumer must be set here
-    const workspaceGraph = await _scopeGraph().default.buildGraphFromWorkspace(consumer, onlyLatest);
-    const dependencyGraph = new (_scopeGraph().default)(workspaceGraph);
+    const workspaceGraph = await _legacy().DependencyGraph.buildGraphFromWorkspace(consumer, onlyLatest);
+    const dependencyGraph = new (_legacy().DependencyGraph)(workspaceGraph);
     if (id) {
       // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!
       const componentGraph = dependencyGraph.getSubGraphOfConnectedComponents(bitId);
-      const componentDepGraph = new (_scopeGraph().default)(componentGraph);
+      const componentDepGraph = new (_legacy().DependencyGraph)(componentGraph);
       return componentDepGraph.graph;
     }
     return dependencyGraph.graph;

package/dist/graph-cmd.js.map

@@ -1 +1 @@
-{"version":3,"names":["_chalk","data","_interopRequireDefault","require","_os","path","_interopRequireWildcard","_graphlib","_componentId","_toolboxString","_vizgraph","_consumer","_scopeGraph","_exceptions","_getRemoteByName","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","hasOwnProperty","call","i","set","_defineProperty","_toPropertyKey","value","enumerable","configurable","writable","_toPrimitive","Symbol","toPrimitive","TypeError","String","Number","GraphCmd","constructor","componentAspect","report","id","remote","allVersions","layout","image","consumer","loadConsumerIfExist","ConsumerNotFound","graph","generateGraph","config","visualDependencyGraph","VisualDependencyGraph","loadFromGraphlib","join","os","tmpdir","generateRandomStr","result","chalk","green","getBitId","undefined","ComponentID","fromString","getParsedId","bitId","scopeName","scope","remoteScope","getRemoteByName","componentDepGraph","Error","onlyLatest","workspaceGraph","DependencyGraph","buildGraphFromWorkspace","dependencyGraph","componentGraph","getSubGraphOfConnectedComponents","json","GraphLib","write","exports"],"sources":["graph-cmd.ts"],"sourcesContent":["import chalk from 'chalk';\nimport os from 'os';\nimport * as path from 'path';\nimport GraphLib from 'graphlib';\nimport { Command, CommandOptions } from '@teambit/cli';\nimport { ComponentID } from '@teambit/component-id';\nimport { generateRandomStr } from '@teambit/toolbox.string.random';\nimport VisualDependencyGraph from '@teambit/legacy/dist/scope/graph/vizgraph';\nimport { Consumer, loadConsumerIfExist } from '@teambit/legacy/dist/consumer';\nimport DependencyGraph from '@teambit/legacy/dist/scope/graph/scope-graph';\nimport { ConsumerNotFound } from '@teambit/legacy/dist/consumer/exceptions';\nimport getRemoteByName from '@teambit/legacy/dist/remotes/get-remote-by-name';\nimport { ComponentMain } from '@teambit/component';\n\ntype GraphOpt = {\n  image?: string;\n  remote?: string;\n  allVersions?: boolean;\n  layout?: string;\n  json?: boolean;\n};\n\nexport class GraphCmd implements Command {\n  name = 'graph [id]';\n  description = \"generate an image file with the workspace components' dependencies graph\";\n  extendedDescription: 'black arrow is a runtime dependency. red arrow is either dev or peer';\n  group = 'discover';\n  alias = '';\n  options = [\n    ['i', 'image <image>', 'image path and format. use one of the following extensions: [gif, png, svg, pdf]'],\n    ['r', 'remote [remoteName]', 'remote name (name is optional, leave empty when id is specified)'],\n    ['', 'all-versions', 'enter all components versions into the graph, not only latest'],\n    [\n      '',\n      'layout <name>',\n      'GraphVis layout. default to \"dot\". options are [circo, dot, fdp, neato, osage, patchwork, sfdp, twopi]',\n    ],\n    ['j', 'json', 'json format'],\n  ] as CommandOptions;\n  remoteOp = true;\n\n  constructor(private componentAspect: ComponentMain) {}\n\n  async report([id]: [string], { remote, allVersions, layout, image }: GraphOpt): Promise<string> {\n    const consumer = await loadConsumerIfExist();\n    if (!consumer && !remote) throw new ConsumerNotFound();\n\n    const graph = await this.generateGraph(consumer, id, remote, allVersions);\n\n    const config = {};\n    // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n    if (layout) config.layout = layout;\n    const visualDependencyGraph = await VisualDependencyGraph.loadFromGraphlib(graph, config);\n\n    image = image || path.join(os.tmpdir(), `${generateRandomStr()}.png`);\n    const result = await visualDependencyGraph.image(image);\n\n    return chalk.green(`image created at ${result}`);\n  }\n\n  private async generateGraph(\n    consumer?: Consumer,\n    id?: string,\n    remote?: string,\n    allVersions?: boolean\n  ): Promise<GraphLib.Graph> {\n    if (!consumer && !remote) throw new ConsumerNotFound();\n    const getBitId = (): ComponentID | undefined => {\n      if (!id) return undefined;\n      if (remote) return ComponentID.fromString(id); // user used --remote so we know it has a scope\n      // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n      return consumer.getParsedId(id);\n    };\n    const bitId = getBitId();\n    if (remote) {\n      if (id) {\n        // @ts-ignore scope must be set as it came from a remote\n        const scopeName: string = typeof remote === 'string' ? remote : bitId.scope;\n        const remoteScope = await getRemoteByName(scopeName, consumer);\n        const componentDepGraph = await remoteScope.graph(bitId);\n        return componentDepGraph.graph;\n      }\n      if (typeof remote !== 'string') {\n        throw new Error('please specify remote scope name or enter an id');\n      }\n      const remoteScope = await getRemoteByName(remote, consumer);\n      const componentDepGraph = await remoteScope.graph();\n      return componentDepGraph.graph;\n    }\n\n    const onlyLatest = !allVersions;\n    // @ts-ignore consumer must be set here\n    const workspaceGraph = await DependencyGraph.buildGraphFromWorkspace(consumer, onlyLatest);\n    const dependencyGraph = new DependencyGraph(workspaceGraph);\n    if (id) {\n      // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n      const componentGraph = dependencyGraph.getSubGraphOfConnectedComponents(bitId);\n      const componentDepGraph = new DependencyGraph(componentGraph);\n      return componentDepGraph.graph;\n    }\n    return dependencyGraph.graph;\n  }\n\n  async json([id]: [string], { remote, allVersions }: GraphOpt) {\n    const consumer = await loadConsumerIfExist();\n    if (!consumer && !remote) throw new ConsumerNotFound();\n\n    const graph = await this.generateGraph(consumer, id, remote, allVersions);\n    return GraphLib.json.write(graph);\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAH,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,IAAA;EAAA,MAAAH,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAC,GAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,KAAA;EAAA,MAAAJ,IAAA,GAAAK,uBAAA,CAAAH,OAAA;EAAAE,IAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,UAAA;EAAA,MAAAN,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAI,SAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAO,aAAA;EAAA,MAAAP,IAAA,GAAAE,OAAA;EAAAK,YAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,eAAA;EAAA,MAAAR,IAAA,GAAAE,OAAA;EAAAM,cAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,UAAA;EAAA,MAAAT,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAO,SAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAU,UAAA;EAAA,MAAAV,IAAA,GAAAE,OAAA;EAAAQ,SAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAW,YAAA;EAAA,MAAAX,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAS,WAAA,YAAAA,CAAA;IAAA,OAAAX,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAY,YAAA;EAAA,MAAAZ,IAAA,GAAAE,OAAA;EAAAU,WAAA,YAAAA,CAAA;IAAA,OAAAZ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAa,iBAAA;EAAA,MAAAb,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAW,gBAAA,YAAAA,CAAA;IAAA,OAAAb,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8E,SAAAc,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAV,wBAAAU,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,OAAAC,cAAA,CAAAC,IAAA,CAAAhB,CAAA,EAAAc,CAAA,SAAAG,CAAA,GAAAP,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAG,CAAA,KAAAA,CAAA,CAAAV,GAAA,IAAAU,CAAA,CAAAC,GAAA,IAAAP,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAG,CAAA,IAAAT,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAe,GAAA,CAAAlB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAAtB,uBAAAc,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAI,UAAA,GAAAJ,CAAA,KAAAK,OAAA,EAAAL,CAAA;AAAA,SAAAmB,gBAAAnB,CAAA,EAAAE,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAkB,cAAA,CAAAlB,CAAA,MAAAF,CAAA,GAAAW,MAAA,CAAAC,cAAA,CAAAZ,CAAA,EAAAE,CAAA,IAAAmB,KAAA,EAAAlB,CAAA,EAAAmB,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAxB,CAAA,CAAAE,CAAA,IAAAC,CAAA,EAAAH,CAAA;AAAA,SAAAoB,eAAAjB,CAAA,QAAAc,CAAA,GAAAQ,YAAA,CAAAtB,CAAA,uCAAAc,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAQ,aAAAtB,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAH,CAAA,GAAAG,CAAA,CAAAuB,MAAA,CAAAC,WAAA,kBAAA3B,CAAA,QAAAiB,CAAA,GAAAjB,CAAA,CAAAgB,IAAA,CAAAb,CAAA,EAAAD,CAAA,uCAAAe,CAAA,SAAAA,CAAA,YAAAW,SAAA,yEAAA1B,CAAA,GAAA2B,MAAA,GAAAC,MAAA,EAAA3B,CAAA;AAWvE,MAAM4B,QAAQ,CAAoB;EAmBvCC,WAAWA,CAASC,eAA8B,EAAE;IAAA,KAAhCA,eAA8B,GAA9BA,eAA8B;IAAAd,eAAA,eAlB3C,YAAY;IAAAA,eAAA,sBACL,0EAA0E;IAAAA,eAAA;IAAAA,eAAA,gBAEhF,UAAU;IAAAA,eAAA,gBACV,EAAE;IAAAA,eAAA,kBACA,CACR,CAAC,GAAG,EAAE,eAAe,EAAE,kFAAkF,CAAC,EAC1G,CAAC,GAAG,EAAE,qBAAqB,EAAE,kEAAkE,CAAC,EAChG,CAAC,EAAE,EAAE,cAAc,EAAE,+DAA+D,CAAC,EACrF,CACE,EAAE,EACF,eAAe,EACf,wGAAwG,CACzG,EACD,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,CAAC,CAC7B;IAAAA,eAAA,mBACU,IAAI;EAEsC;EAErD,MAAMe,MAAMA,CAAC,CAACC,EAAE,CAAW,EAAE;IAAEC,MAAM;IAAEC,WAAW;IAAEC,MAAM;IAAEC;EAAgB,CAAC,EAAmB;IAC9F,MAAMC,QAAQ,GAAG,MAAM,IAAAC,+BAAmB,EAAC,CAAC;IAC5C,IAAI,CAACD,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IAEtD,MAAMC,KAAK,GAAG,MAAM,IAAI,CAACC,aAAa,CAACJ,QAAQ,EAAEL,EAAE,EAAEC,MAAM,EAAEC,WAAW,CAAC;IAEzE,MAAMQ,MAAM,GAAG,CAAC,CAAC;IACjB;IACA,IAAIP,MAAM,EAAEO,MAAM,CAACP,MAAM,GAAGA,MAAM;IAClC,MAAMQ,qBAAqB,GAAG,MAAMC,mBAAqB,CAACC,gBAAgB,CAACL,KAAK,EAAEE,MAAM,CAAC;IAEzFN,KAAK,GAAGA,KAAK,IAAIlD,IAAI,CAAD,CAAC,CAAC4D,IAAI,CAACC,aAAE,CAACC,MAAM,CAAC,CAAC,EAAE,GAAG,IAAAC,kCAAiB,EAAC,CAAC,MAAM,CAAC;IACrE,MAAMC,MAAM,GAAG,MAAMP,qBAAqB,CAACP,KAAK,CAACA,KAAK,CAAC;IAEvD,OAAOe,gBAAK,CAACC,KAAK,CAAC,oBAAoBF,MAAM,EAAE,CAAC;EAClD;EAEA,MAAcT,aAAaA,CACzBJ,QAAmB,EACnBL,EAAW,EACXC,MAAe,EACfC,WAAqB,EACI;IACzB,IAAI,CAACG,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IACtD,MAAMc,QAAQ,GAAGA,CAAA,KAA+B;MAC9C,IAAI,CAACrB,EAAE,EAAE,OAAOsB,SAAS;MACzB,IAAIrB,MAAM,EAAE,OAAOsB,0BAAW,CAACC,UAAU,CAACxB,EAAE,CAAC,CAAC,CAAC;MAC/C;MACA,OAAOK,QAAQ,CAACoB,WAAW,CAACzB,EAAE,CAAC;IACjC,CAAC;IACD,MAAM0B,KAAK,GAAGL,QAAQ,CAAC,CAAC;IACxB,IAAIpB,MAAM,EAAE;MACV,IAAID,EAAE,EAAE;QACN;QACA,MAAM2B,SAAiB,GAAG,OAAO1B,MAAM,KAAK,QAAQ,GAAGA,MAAM,GAAGyB,KAAK,CAACE,KAAK;QAC3E,MAAMC,WAAW,GAAG,MAAM,IAAAC,0BAAe,EAACH,SAAS,EAAEtB,QAAQ,CAAC;QAC9D,MAAM0B,iBAAiB,GAAG,MAAMF,WAAW,CAACrB,KAAK,CAACkB,KAAK,CAAC;QACxD,OAAOK,iBAAiB,CAACvB,KAAK;MAChC;MACA,IAAI,OAAOP,MAAM,KAAK,QAAQ,EAAE;QAC9B,MAAM,IAAI+B,KAAK,CAAC,iDAAiD,CAAC;MACpE;MACA,MAAMH,WAAW,GAAG,MAAM,IAAAC,0BAAe,EAAC7B,MAAM,EAAEI,QAAQ,CAAC;MAC3D,MAAM0B,iBAAiB,GAAG,MAAMF,WAAW,CAACrB,KAAK,CAAC,CAAC;MACnD,OAAOuB,iBAAiB,CAACvB,KAAK;IAChC;IAEA,MAAMyB,UAAU,GAAG,CAAC/B,WAAW;IAC/B;IACA,MAAMgC,cAAc,GAAG,MAAMC,qBAAe,CAACC,uBAAuB,CAAC/B,QAAQ,EAAE4B,UAAU,CAAC;IAC1F,MAAMI,eAAe,GAAG,KAAIF,qBAAe,EAACD,cAAc,CAAC;IAC3D,IAAIlC,EAAE,EAAE;MACN;MACA,MAAMsC,cAAc,GAAGD,eAAe,CAACE,gCAAgC,CAACb,KAAK,CAAC;MAC9E,MAAMK,iBAAiB,GAAG,KAAII,qBAAe,EAACG,cAAc,CAAC;MAC7D,OAAOP,iBAAiB,CAACvB,KAAK;IAChC;IACA,OAAO6B,eAAe,CAAC7B,KAAK;EAC9B;EAEA,MAAMgC,IAAIA,CAAC,CAACxC,EAAE,CAAW,EAAE;IAAEC,MAAM;IAAEC;EAAsB,CAAC,EAAE;IAC5D,MAAMG,QAAQ,GAAG,MAAM,IAAAC,+BAAmB,EAAC,CAAC;IAC5C,IAAI,CAACD,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IAEtD,MAAMC,KAAK,GAAG,MAAM,IAAI,CAACC,aAAa,CAACJ,QAAQ,EAAEL,EAAE,EAAEC,MAAM,EAAEC,WAAW,CAAC;IACzE,OAAOuC,mBAAQ,CAACD,IAAI,CAACE,KAAK,CAAClC,KAAK,CAAC;EACnC;AACF;AAACmC,OAAA,CAAA/C,QAAA,GAAAA,QAAA","ignoreList":[]}
+{"version":3,"names":["_chalk","data","_interopRequireDefault","require","_os","path","_interopRequireWildcard","_graphlib","_componentId","_toolboxString","_consumer","_legacy","_exceptions","_getRemoteByName","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","hasOwnProperty","call","i","set","_defineProperty","_toPropertyKey","value","enumerable","configurable","writable","_toPrimitive","Symbol","toPrimitive","TypeError","String","Number","GraphCmd","constructor","componentAspect","report","id","remote","allVersions","layout","image","consumer","loadConsumerIfExist","ConsumerNotFound","graph","generateGraph","config","visualDependencyGraph","VisualDependencyGraph","loadFromGraphlib","join","os","tmpdir","generateRandomStr","result","chalk","green","getBitId","undefined","ComponentID","fromString","getParsedId","bitId","scopeName","scope","remoteScope","getRemoteByName","componentDepGraph","Error","onlyLatest","workspaceGraph","DependencyGraph","buildGraphFromWorkspace","dependencyGraph","componentGraph","getSubGraphOfConnectedComponents","json","GraphLib","write","exports"],"sources":["graph-cmd.ts"],"sourcesContent":["import chalk from 'chalk';\nimport os from 'os';\nimport * as path from 'path';\nimport GraphLib from 'graphlib';\nimport { Command, CommandOptions } from '@teambit/cli';\nimport { ComponentID } from '@teambit/component-id';\nimport { generateRandomStr } from '@teambit/toolbox.string.random';\nimport { Consumer, loadConsumerIfExist } from '@teambit/legacy/dist/consumer';\nimport { DependencyGraph, VisualDependencyGraph } from '@teambit/legacy.dependency-graph';\nimport { ConsumerNotFound } from '@teambit/legacy/dist/consumer/exceptions';\nimport getRemoteByName from '@teambit/legacy/dist/remotes/get-remote-by-name';\nimport { ComponentMain } from '@teambit/component';\n\ntype GraphOpt = {\n  image?: string;\n  remote?: string;\n  allVersions?: boolean;\n  layout?: string;\n  json?: boolean;\n};\n\nexport class GraphCmd implements Command {\n  name = 'graph [id]';\n  description = \"generate an image file with the workspace components' dependencies graph\";\n  extendedDescription: 'black arrow is a runtime dependency. red arrow is either dev or peer';\n  group = 'discover';\n  alias = '';\n  options = [\n    ['i', 'image <image>', 'image path and format. use one of the following extensions: [gif, png, svg, pdf]'],\n    ['r', 'remote [remoteName]', 'remote name (name is optional, leave empty when id is specified)'],\n    ['', 'all-versions', 'enter all components versions into the graph, not only latest'],\n    [\n      '',\n      'layout <name>',\n      'GraphVis layout. default to \"dot\". options are [circo, dot, fdp, neato, osage, patchwork, sfdp, twopi]',\n    ],\n    ['j', 'json', 'json format'],\n  ] as CommandOptions;\n  remoteOp = true;\n\n  constructor(private componentAspect: ComponentMain) {}\n\n  async report([id]: [string], { remote, allVersions, layout, image }: GraphOpt): Promise<string> {\n    const consumer = await loadConsumerIfExist();\n    if (!consumer && !remote) throw new ConsumerNotFound();\n\n    const graph = await this.generateGraph(consumer, id, remote, allVersions);\n\n    const config = {};\n    // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n    if (layout) config.layout = layout;\n    const visualDependencyGraph = await VisualDependencyGraph.loadFromGraphlib(graph, config);\n\n    image = image || path.join(os.tmpdir(), `${generateRandomStr()}.png`);\n    const result = await visualDependencyGraph.image(image);\n\n    return chalk.green(`image created at ${result}`);\n  }\n\n  private async generateGraph(\n    consumer?: Consumer,\n    id?: string,\n    remote?: string,\n    allVersions?: boolean\n  ): Promise<GraphLib.Graph> {\n    if (!consumer && !remote) throw new ConsumerNotFound();\n    const getBitId = (): ComponentID | undefined => {\n      if (!id) return undefined;\n      if (remote) return ComponentID.fromString(id); // user used --remote so we know it has a scope\n      // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n      return consumer.getParsedId(id);\n    };\n    const bitId = getBitId();\n    if (remote) {\n      if (id) {\n        // @ts-ignore scope must be set as it came from a remote\n        const scopeName: string = typeof remote === 'string' ? remote : bitId.scope;\n        const remoteScope = await getRemoteByName(scopeName, consumer);\n        const componentDepGraph = await remoteScope.graph(bitId);\n        return componentDepGraph.graph;\n      }\n      if (typeof remote !== 'string') {\n        throw new Error('please specify remote scope name or enter an id');\n      }\n      const remoteScope = await getRemoteByName(remote, consumer);\n      const componentDepGraph = await remoteScope.graph();\n      return componentDepGraph.graph;\n    }\n\n    const onlyLatest = !allVersions;\n    // @ts-ignore consumer must be set here\n    const workspaceGraph = await DependencyGraph.buildGraphFromWorkspace(consumer, onlyLatest);\n    const dependencyGraph = new DependencyGraph(workspaceGraph);\n    if (id) {\n      // @ts-ignore AUTO-ADDED-AFTER-MIGRATION-PLEASE-FIX!\n      const componentGraph = dependencyGraph.getSubGraphOfConnectedComponents(bitId);\n      const componentDepGraph = new DependencyGraph(componentGraph);\n      return componentDepGraph.graph;\n    }\n    return dependencyGraph.graph;\n  }\n\n  async json([id]: [string], { remote, allVersions }: GraphOpt) {\n    const consumer = await loadConsumerIfExist();\n    if (!consumer && !remote) throw new ConsumerNotFound();\n\n    const graph = await this.generateGraph(consumer, id, remote, allVersions);\n    return GraphLib.json.write(graph);\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAH,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,IAAA;EAAA,MAAAH,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAC,GAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,KAAA;EAAA,MAAAJ,IAAA,GAAAK,uBAAA,CAAAH,OAAA;EAAAE,IAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,UAAA;EAAA,MAAAN,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAI,SAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAO,aAAA;EAAA,MAAAP,IAAA,GAAAE,OAAA;EAAAK,YAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,eAAA;EAAA,MAAAR,IAAA,GAAAE,OAAA;EAAAM,cAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,UAAA;EAAA,MAAAT,IAAA,GAAAE,OAAA;EAAAO,SAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAU,QAAA;EAAA,MAAAV,IAAA,GAAAE,OAAA;EAAAQ,OAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAW,YAAA;EAAA,MAAAX,IAAA,GAAAE,OAAA;EAAAS,WAAA,YAAAA,CAAA;IAAA,OAAAX,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAY,iBAAA;EAAA,MAAAZ,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAU,gBAAA,YAAAA,CAAA;IAAA,OAAAZ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8E,SAAAa,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAT,wBAAAS,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,OAAAC,cAAA,CAAAC,IAAA,CAAAhB,CAAA,EAAAc,CAAA,SAAAG,CAAA,GAAAP,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAG,CAAA,KAAAA,CAAA,CAAAV,GAAA,IAAAU,CAAA,CAAAC,GAAA,IAAAP,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAG,CAAA,IAAAT,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAe,GAAA,CAAAlB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAArB,uBAAAa,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAI,UAAA,GAAAJ,CAAA,KAAAK,OAAA,EAAAL,CAAA;AAAA,SAAAmB,gBAAAnB,CAAA,EAAAE,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAkB,cAAA,CAAAlB,CAAA,MAAAF,CAAA,GAAAW,MAAA,CAAAC,cAAA,CAAAZ,CAAA,EAAAE,CAAA,IAAAmB,KAAA,EAAAlB,CAAA,EAAAmB,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAxB,CAAA,CAAAE,CAAA,IAAAC,CAAA,EAAAH,CAAA;AAAA,SAAAoB,eAAAjB,CAAA,QAAAc,CAAA,GAAAQ,YAAA,CAAAtB,CAAA,uCAAAc,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAQ,aAAAtB,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAH,CAAA,GAAAG,CAAA,CAAAuB,MAAA,CAAAC,WAAA,kBAAA3B,CAAA,QAAAiB,CAAA,GAAAjB,CAAA,CAAAgB,IAAA,CAAAb,CAAA,EAAAD,CAAA,uCAAAe,CAAA,SAAAA,CAAA,YAAAW,SAAA,yEAAA1B,CAAA,GAAA2B,MAAA,GAAAC,MAAA,EAAA3B,CAAA;AAWvE,MAAM4B,QAAQ,CAAoB;EAmBvCC,WAAWA,CAASC,eAA8B,EAAE;IAAA,KAAhCA,eAA8B,GAA9BA,eAA8B;IAAAd,eAAA,eAlB3C,YAAY;IAAAA,eAAA,sBACL,0EAA0E;IAAAA,eAAA;IAAAA,eAAA,gBAEhF,UAAU;IAAAA,eAAA,gBACV,EAAE;IAAAA,eAAA,kBACA,CACR,CAAC,GAAG,EAAE,eAAe,EAAE,kFAAkF,CAAC,EAC1G,CAAC,GAAG,EAAE,qBAAqB,EAAE,kEAAkE,CAAC,EAChG,CAAC,EAAE,EAAE,cAAc,EAAE,+DAA+D,CAAC,EACrF,CACE,EAAE,EACF,eAAe,EACf,wGAAwG,CACzG,EACD,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,CAAC,CAC7B;IAAAA,eAAA,mBACU,IAAI;EAEsC;EAErD,MAAMe,MAAMA,CAAC,CAACC,EAAE,CAAW,EAAE;IAAEC,MAAM;IAAEC,WAAW;IAAEC,MAAM;IAAEC;EAAgB,CAAC,EAAmB;IAC9F,MAAMC,QAAQ,GAAG,MAAM,IAAAC,+BAAmB,EAAC,CAAC;IAC5C,IAAI,CAACD,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IAEtD,MAAMC,KAAK,GAAG,MAAM,IAAI,CAACC,aAAa,CAACJ,QAAQ,EAAEL,EAAE,EAAEC,MAAM,EAAEC,WAAW,CAAC;IAEzE,MAAMQ,MAAM,GAAG,CAAC,CAAC;IACjB;IACA,IAAIP,MAAM,EAAEO,MAAM,CAACP,MAAM,GAAGA,MAAM;IAClC,MAAMQ,qBAAqB,GAAG,MAAMC,+BAAqB,CAACC,gBAAgB,CAACL,KAAK,EAAEE,MAAM,CAAC;IAEzFN,KAAK,GAAGA,KAAK,IAAIjD,IAAI,CAAD,CAAC,CAAC2D,IAAI,CAACC,aAAE,CAACC,MAAM,CAAC,CAAC,EAAE,GAAG,IAAAC,kCAAiB,EAAC,CAAC,MAAM,CAAC;IACrE,MAAMC,MAAM,GAAG,MAAMP,qBAAqB,CAACP,KAAK,CAACA,KAAK,CAAC;IAEvD,OAAOe,gBAAK,CAACC,KAAK,CAAC,oBAAoBF,MAAM,EAAE,CAAC;EAClD;EAEA,MAAcT,aAAaA,CACzBJ,QAAmB,EACnBL,EAAW,EACXC,MAAe,EACfC,WAAqB,EACI;IACzB,IAAI,CAACG,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IACtD,MAAMc,QAAQ,GAAGA,CAAA,KAA+B;MAC9C,IAAI,CAACrB,EAAE,EAAE,OAAOsB,SAAS;MACzB,IAAIrB,MAAM,EAAE,OAAOsB,0BAAW,CAACC,UAAU,CAACxB,EAAE,CAAC,CAAC,CAAC;MAC/C;MACA,OAAOK,QAAQ,CAACoB,WAAW,CAACzB,EAAE,CAAC;IACjC,CAAC;IACD,MAAM0B,KAAK,GAAGL,QAAQ,CAAC,CAAC;IACxB,IAAIpB,MAAM,EAAE;MACV,IAAID,EAAE,EAAE;QACN;QACA,MAAM2B,SAAiB,GAAG,OAAO1B,MAAM,KAAK,QAAQ,GAAGA,MAAM,GAAGyB,KAAK,CAACE,KAAK;QAC3E,MAAMC,WAAW,GAAG,MAAM,IAAAC,0BAAe,EAACH,SAAS,EAAEtB,QAAQ,CAAC;QAC9D,MAAM0B,iBAAiB,GAAG,MAAMF,WAAW,CAACrB,KAAK,CAACkB,KAAK,CAAC;QACxD,OAAOK,iBAAiB,CAACvB,KAAK;MAChC;MACA,IAAI,OAAOP,MAAM,KAAK,QAAQ,EAAE;QAC9B,MAAM,IAAI+B,KAAK,CAAC,iDAAiD,CAAC;MACpE;MACA,MAAMH,WAAW,GAAG,MAAM,IAAAC,0BAAe,EAAC7B,MAAM,EAAEI,QAAQ,CAAC;MAC3D,MAAM0B,iBAAiB,GAAG,MAAMF,WAAW,CAACrB,KAAK,CAAC,CAAC;MACnD,OAAOuB,iBAAiB,CAACvB,KAAK;IAChC;IAEA,MAAMyB,UAAU,GAAG,CAAC/B,WAAW;IAC/B;IACA,MAAMgC,cAAc,GAAG,MAAMC,yBAAe,CAACC,uBAAuB,CAAC/B,QAAQ,EAAE4B,UAAU,CAAC;IAC1F,MAAMI,eAAe,GAAG,KAAIF,yBAAe,EAACD,cAAc,CAAC;IAC3D,IAAIlC,EAAE,EAAE;MACN;MACA,MAAMsC,cAAc,GAAGD,eAAe,CAACE,gCAAgC,CAACb,KAAK,CAAC;MAC9E,MAAMK,iBAAiB,GAAG,KAAII,yBAAe,EAACG,cAAc,CAAC;MAC7D,OAAOP,iBAAiB,CAACvB,KAAK;IAChC;IACA,OAAO6B,eAAe,CAAC7B,KAAK;EAC9B;EAEA,MAAMgC,IAAIA,CAAC,CAACxC,EAAE,CAAW,EAAE;IAAEC,MAAM;IAAEC;EAAsB,CAAC,EAAE;IAC5D,MAAMG,QAAQ,GAAG,MAAM,IAAAC,+BAAmB,EAAC,CAAC;IAC5C,IAAI,CAACD,QAAQ,IAAI,CAACJ,MAAM,EAAE,MAAM,KAAIM,8BAAgB,EAAC,CAAC;IAEtD,MAAMC,KAAK,GAAG,MAAM,IAAI,CAACC,aAAa,CAACJ,QAAQ,EAAEL,EAAE,EAAEC,MAAM,EAAEC,WAAW,CAAC;IACzE,OAAOuC,mBAAQ,CAACD,IAAI,CAACE,KAAK,CAAClC,KAAK,CAAC;EACnC;AACF;AAACmC,OAAA,CAAA/C,QAAA,GAAAA,QAAA","ignoreList":[]}

package/dist/{preview-1733069682179.js → preview-1733282408194.js}

@@ -1,5 +1,5 @@
-import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.component_graph@1.0.482/dist/graph.composition.js';
-import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.component_graph@1.0.482/dist/graph.docs.md';
+import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.component_graph@1.0.484/dist/graph.composition.js';
+import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad/teambit.component_graph@1.0.484/dist/graph.docs.md';
 
 export const compositions = [compositions_0];
 export const overview = [overview_0];

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@teambit/graph",
-  "version": "1.0.482",
+  "version": "1.0.484",
   "homepage": "https://bit.cloud/teambit/component/graph",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.482"
+    "version": "1.0.484"
   },
   "dependencies": {
     "graphlib": "2.1.8",
@@ -33,14 +33,15 @@
     "@teambit/design.ui.pages.not-found": "0.0.371",
     "@teambit/design.ui.pages.server-error": "0.0.368",
     "@teambit/ui-foundation.ui.react-router.use-query": "0.0.501",
-    "@teambit/component": "1.0.482",
-    "@teambit/cli": "0.0.1059",
+    "@teambit/legacy.dependency-graph": "0.0.2",
+    "@teambit/component": "1.0.484",
+    "@teambit/cli": "0.0.1061",
     "@teambit/toolbox.string.random": "0.0.1",
     "@teambit/component.ui.component-compare.models.component-compare-props": "0.0.112",
-    "@teambit/graphql": "1.0.482",
-    "@teambit/logger": "0.0.1152",
-    "@teambit/component-compare": "1.0.482",
-    "@teambit/ui": "1.0.482",
+    "@teambit/graphql": "1.0.484",
+    "@teambit/logger": "0.0.1154",
+    "@teambit/component-compare": "1.0.484",
+    "@teambit/ui": "1.0.484",
     "@teambit/component.modules.component-url": "0.0.169",
     "@teambit/envs.ui.env-icon": "0.0.505",
     "@teambit/component.ui.component-compare.context": "0.0.118"