@nrwl/workspace
Version:
116 lines • 3.9 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", { value: true });
exports.findFilesInCircularPath = exports.checkCircularPath = exports.pathExists = exports.getPath = void 0;
const reach = {
graph: null,
matrix: null,
adjList: null,
};
function buildMatrix(graph) {
const nodes = Object.keys(graph.nodes);
const nodesLength = nodes.length;
const adjList = {};
const matrix = {};
// create matrix value set
for (let i = 0; i < nodesLength; i++) {
const v = nodes[i];
adjList[v] = [];
// meeroslav: turns out this is 10x faster than spreading the pre-generated initMatrixValues
matrix[v] = {};
}
const projectsWithDependencies = Object.keys(graph.dependencies);
for (let i = 0; i < projectsWithDependencies.length; i++) {
const dependencies = graph.dependencies[projectsWithDependencies[i]];
for (let j = 0; j < dependencies.length; j++) {
const dependency = dependencies[j];
if (graph.nodes[dependency.target]) {
adjList[dependency.source].push(dependency.target);
}
}
}
const traverse = (s, v) => {
matrix[s][v] = true;
const adjListLength = adjList[v].length;
for (let i = 0; i < adjListLength; i++) {
const adj = adjList[v][i];
if (!matrix[s][adj]) {
traverse(s, adj);
}
}
};
for (let i = 0; i < nodesLength; i++) {
const v = nodes[i];
traverse(v, v);
}
return {
matrix,
adjList,
};
}
function getPath(graph, sourceProjectName, targetProjectName) {
if (sourceProjectName === targetProjectName)
return [];
if (reach.graph !== graph) {
const { matrix, adjList } = buildMatrix(graph);
reach.graph = graph;
reach.matrix = matrix;
reach.adjList = adjList;
}
const adjList = reach.adjList;
let path = [];
const queue = [[sourceProjectName, path]];
const visited = [sourceProjectName];
while (queue.length > 0) {
const [current, p] = queue.pop();
path = [...p, current];
if (current === targetProjectName)
break;
if (!adjList[current])
break;
adjList[current]
.filter((adj) => visited.indexOf(adj) === -1)
.filter((adj) => reach.matrix[adj][targetProjectName])
.forEach((adj) => {
visited.push(adj);
queue.push([adj, [...path]]);
});
}
if (path.length > 1) {
return path.map((n) => graph.nodes[n]);
}
else {
return [];
}
}
exports.getPath = getPath;
function pathExists(graph, sourceProjectName, targetProjectName) {
if (sourceProjectName === targetProjectName)
return true;
if (reach.graph !== graph) {
const { matrix, adjList } = buildMatrix(graph);
reach.graph = graph;
reach.matrix = matrix;
reach.adjList = adjList;
}
return !!reach.matrix[sourceProjectName][targetProjectName];
}
exports.pathExists = pathExists;
function checkCircularPath(graph, sourceProject, targetProject) {
if (!graph.nodes[targetProject.name])
return [];
return getPath(graph, targetProject.name, sourceProject.name);
}
exports.checkCircularPath = checkCircularPath;
function findFilesInCircularPath(circularPath) {
const filePathChain = [];
for (let i = 0; i < circularPath.length - 1; i++) {
const next = circularPath[i + 1].name;
const files = circularPath[i].data.files;
filePathChain.push(Object.keys(files)
.filter((key) => files[key].deps && files[key].deps.indexOf(next) !== -1)
.map((key) => files[key].file));
}
return filePathChain;
}
exports.findFilesInCircularPath = findFilesInCircularPath;
//# sourceMappingURL=graph-utils.js.map