本文整理汇总了TypeScript中graphlib.Graph.node方法的典型用法代码示例。如果您正苦于以下问题：TypeScript Graph.node方法的具体用法？TypeScript Graph.node怎么用？TypeScript Graph.node使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类graphlib.Graph的用法示例。
在下文中一共展示了Graph.node方法的5个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的TypeScript代码示例。
示例1: generateOrder
export function generateOrder(proj: project.Project) {
const inputGraph = new Graph<FileInput, {}>({ directed: true });
for (const file of proj.files) {
inputGraph.setNode(file.filename, {
file,
groupName: undefined
});
}
for (const file of proj.files) {
for (const dependency of file.dependencies) {
inputGraph.setEdge(file.filename, dependency.filename);
}
}
const acyclicGraph = new Graph<FileGroup, {}>({ directed: true });
for (const group of alg.tarjan(inputGraph)) {
acyclicGraph.setNode(group[0], {
filenames: group
});
for (const member of group) {
inputGraph.node(member).groupName = group[0];
}
}
for (const filename of inputGraph.nodes()) {
const groupName = inputGraph.node(filename).groupName;
for (const edge of inputGraph.inEdges(filename)) {
const otherGroup = inputGraph.node(edge.w).groupName;
if (groupName !== otherGroup) acyclicGraph.setEdge(groupName, otherGroup);
}
}
const order = alg.topsort(acyclicGraph);
let index = 0;
for (const groupName of order) {
const group = acyclicGraph.node(groupName);
const component: file.SourceFile[] = [];
const cyclic = group.filenames.length !== 1;
for (const filename of group.filenames) {
const file = inputGraph.node(filename).file;
if (cyclic) {
file.hasCircularDependencies = true;
file.connectedComponent = component;
component.push(file);
} else {
file.hasCircularDependencies = false;
}
file.orderIndex = index++;
proj.orderFiles.push(file);
}
}
}示例2: addToGraph
private addToGraph(relativePath, inputPath) {
let normalizedPath = this.pathByNamespace(relativePath);
if (this.graph.node(normalizedPath.id)) return;
let mod = new Module({
id: normalizedPath.id,
namespace: normalizedPath.namespace,
relativePath,
inputPath
});
this.graph.setNode(mod.id, mod);
mod.imports.forEach(dep => {
this.graph.setEdge(mod.id, dep);
let normalizedPath = this.pathByNamespace(relativePath);
if (normalizedPath.namespace === this.namespace) {
let inputPath = `${this.srcDir}/${relativePath}.ts`;
let outputPath = `${this.destDir}/${relativePath}.ts`;
this.addToGraph(relativePath, inputPath);
} else {
console.log('EXTERNAL: ' + normalizedPath.path);
}
});
}示例3: verifyGraph
private verifyGraph(relativePath: string, inputPath: string) {
let normalizedPath = this.pathByNamespace(relativePath);
let mod = this.graph.node(normalizedPath.id);
let patchImports = mod.calculateImports();
return patchImports.map(patch => {
let operation = patch[0];
let importPath = patch[1];
if (this.graph.node(importPath)) {
if (operation === 'connect') {
this.graph.setEdge(relativePath, importPath);
let inEdges = this.graph.outEdges(importPath);
let inEdgePaths = inEdges.map(edge => this.graph.node(edge.v).inputPath);
return [inputPath, ...inEdgePaths];
} else if (operation === 'disconnect') {
this.graph.removeEdge(normalizedPath.id, importPath);
let inEdges = this.graph.inEdges(importPath);
return null;
}
}
// TODO we need to handle things coming out of node_modules
}).filter(Boolean);
}示例4: if
return patchImports.map(patch => {
let operation = patch[0];
let importPath = patch[1];
if (this.graph.node(importPath)) {
if (operation === 'connect') {
this.graph.setEdge(relativePath, importPath);
let inEdges = this.graph.outEdges(importPath);
let inEdgePaths = inEdges.map(edge => this.graph.node(edge.v).inputPath);
return [inputPath, ...inEdgePaths];
} else if (operation === 'disconnect') {
this.graph.removeEdge(normalizedPath.id, importPath);
let inEdges = this.graph.inEdges(importPath);
return null;
}
}
// TODO we need to handle things coming out of node_modules
}).filter(Boolean);示例5:
let inEdgePaths = inEdges.map(edge => this.graph.node(edge.v).inputPath);