本文整理汇总了TypeScript中graphlib.Graph.removeEdge方法的典型用法代码示例。如果您正苦于以下问题：TypeScript Graph.removeEdge方法的具体用法？TypeScript Graph.removeEdge怎么用？TypeScript Graph.removeEdge使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类graphlib.Graph的用法示例。
在下文中一共展示了Graph.removeEdge方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的TypeScript代码示例。
示例1: 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());
}示例2: 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);