本文整理汇总了TypeScript中graphlib.alg.isAcyclic方法的典型用法代码示例。如果您正苦于以下问题：TypeScript alg.isAcyclic方法的具体用法？TypeScript alg.isAcyclic怎么用？TypeScript alg.isAcyclic使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类graphlib.alg的用法示例。
在下文中一共展示了alg.isAcyclic方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的TypeScript代码示例。
示例1: fromSchemas
static fromSchemas(dependencies : Array<model.Dependency>, jobs : Array<model.BuildSchema>) : PipelineGraph {
let options = { directed: true, compound: false, multigraph: false };
let graph : Graphlib.Graph<model.BuildSchema, void> = new Graphlib.Graph(options);
jobs.forEach((job : model.BuildSchema) => {
graph.setNode(job._id, job);
});
let jobsByRepo : Map<string, model.BuildSchema> = new Map();
jobs.forEach(job => jobsByRepo.set(job.repo, job));
dependencies.forEach((dependency : model.Dependency) => {
if(jobsByRepo.has(dependency.up) && jobsByRepo.has(dependency.down)) {
graph.setEdge(jobsByRepo.get(dependency.up)._id, jobsByRepo.get(dependency.down)._id);
}
});
if(!Graphlib.alg.isAcyclic(graph)) {
throw new Error('pipeline graph contains circular dependencies:' + JSON.stringify(Graphlib.json.write(graph)));
}
if(graph.sources().length > 1) {
throw new Error('pipeline graph has more than one source nodes: ' + JSON.stringify(Graphlib.json.write(graph)));
}
let pipelineGraph = new PipelineGraph();
pipelineGraph._graph = graph;
pipelineGraph._dependencies = dependencies;
pipelineGraph._builds = jobs;
return pipelineGraph;
}示例2: createDependencyGraphFromSchema
function createDependencyGraphFromSchema(data : model.DependencyGraphSchema,
repos : Map<string, model.RepositorySchema>) : Graphlib.Graph<model.RepositorySchema, void> {
let options = { directed: true, compound: false, multigraph: false };
let graph : Graphlib.Graph<model.RepositorySchema, void> = new Graphlib.Graph(options);
data.repos.forEach((repoName : string) => {
let repo = repos.get(repoName);
if(!repo) {
throw new Error(`cannot create dependency graph, repository ${repoName} not found`);
}
graph.setNode(repoName, repo);
});
data.dependencies.forEach((dependency : model.Dependency) => {
if(repos.has(dependency.up) && repos.has(dependency.down)) {
graph.setEdge(dependency.up, dependency.down);
}
});
if(!Graphlib.alg.isAcyclic(graph)) {
throw new Error('cannot create dependency graph, contains circular dependencies: ' + JSON.stringify(data));
}
return graph;
}示例3: test_graph
function test_graph() {
var g = new graphlib.Graph({
compound: true,
directed: true,
multigraph: true
});
g.setEdge('a', 'b');
g.setEdge('a', 'b', 1.023, 'test');
g.setEdge({ v: 'a', w: 'b', name: 'test' }, 1.023);
g.hasEdge('a', 'b', 'test');
g.hasEdge({ v: 'a', w: 'b', name: 'test' });
g.removeEdge('a', 'b', 'test');
g.removeEdge({ v: 'a', w: 'b', name: 'test' });
g.edge('a', 'b', 'test');
g.edge({v: 'a', w: 'b', name: 'test'});
g.setDefaultNodeLabel({});
g.setDefaultNodeLabel(() => 42);
g.setDefaultEdgeLabel({});
g.setDefaultEdgeLabel(() => 'e42');
g.setNodes(['a', 'b', 'c'], 42);
g.setParent('d', 'a');
g.setParent('d');
g.parent('d');
g.children('a');
g.filterNodes(v => true);
g.setPath(['a', 'b', 'c'], 42);
graphlib.json.read(graphlib.json.write(g));
graphlib.alg.dijkstra(g, 'a', e => g.edge(e));
graphlib.alg.dijkstraAll(g, e => g.edge(e));
graphlib.alg.dijkstraAll(g);
graphlib.alg.findCycles(g);
graphlib.alg.isAcyclic(g);
graphlib.alg.prim(g, e => g.edge(e));
graphlib.alg.tarjan(g);
graphlib.alg.topsort(g);
graphlib.alg.preorder(g, g.nodes());
graphlib.alg.postorder(g, g.nodes());
}示例4: test_graph
function test_graph() {
var g = new graphlib.Graph();
g.setEdge('a', 'b');
g.setEdge('a', 'b', 1.023);
g.edge('a', 'b');
g.edge({v: 'a', w: 'b'});
graphlib.json.read(graphlib.json.write(g));
graphlib.alg.dijkstra(g, 'a', e => g.edge(e));
graphlib.alg.dijkstraAll(g, e => g.edge(e));
graphlib.alg.dijkstraAll(g);
graphlib.alg.findCycles(g);
graphlib.alg.isAcyclic(g);
graphlib.alg.prim(g, e => g.edge(e));
graphlib.alg.tarjan(g);
graphlib.alg.topsort(g);
}