本文整理匯總了TypeScript中vs/base/common/graph.Graph類的典型用法代碼示例。如果您正苦於以下問題：TypeScript Graph類的具體用法？TypeScript Graph怎麽用？TypeScript Graph使用的例子？那麽, 這裏精選的類代碼示例或許可以為您提供幫助。
在下文中一共展示了Graph類的2個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的TypeScript代碼示例。
示例1: suite
suite('Graph', () => {
var graph: Graph<string>;
setup(() => {
graph = new Graph<string>(s => s);
});
test('cannot be traversed when empty', function() {
graph.traverse('foo', true, () => assert(false));
graph.traverse('foo', false, () => assert(false));
assert(true);
});
test('is possible to lookup nodes that don\'t exist', function() {
assert.deepEqual(graph.lookup('ddd'), null);
});
test('inserts nodes when not there yet', function() {
assert.deepEqual(graph.lookup('ddd'), null);
assert.deepEqual(graph.lookupOrInsertNode('ddd').data, 'ddd');
assert.deepEqual(graph.lookup('ddd').data, 'ddd');
});
test('can remove nodes and get length', function() {
assert.equal(graph.length, 0);
assert.deepEqual(graph.lookup('ddd'), null);
assert.deepEqual(graph.lookupOrInsertNode('ddd').data, 'ddd');
assert.equal(graph.length, 1);
graph.removeNode('ddd');
assert.deepEqual(graph.lookup('ddd'), null);
assert.equal(graph.length, 0);
});
test('traverse from leaf', function() {
graph.insertEdge('foo', 'bar');
graph.traverse('bar', true, (node) => assert.equal(node, 'bar'));
var items = ['bar', 'foo'];
graph.traverse('bar', false, (node) => assert.equal(node, items.shift()));
});
test('traverse from center', function() {
graph.insertEdge('1', '3');
graph.insertEdge('2', '3');
graph.insertEdge('3', '4');
graph.insertEdge('3', '5');
var items = ['3', '4', '5'];
graph.traverse('3', true, (node) => assert.equal(node, items.shift()));
var items = ['3', '1', '2'];
graph.traverse('3', false, (node) => assert.equal(node, items.shift()));
});
test('traverse a chain', function() {
graph.insertEdge('1', '2');
graph.insertEdge('2', '3');
graph.insertEdge('3', '4');
graph.insertEdge('4', '5');
var items = ['1', '2', '3', '4', '5'];
graph.traverse('1', true, (node) => assert.equal(node, items.shift()));
var items = ['1', '2', '3', '4', '5'].reverse();
graph.traverse('5', false, (node) => assert.equal(node, items.shift()));
});
test('root', function() {
graph.insertEdge('1', '2');
var roots = graph.roots();
assert.equal(roots.length, 1);
assert.equal(roots[0].data, '2');
graph.insertEdge('2', '1');
var roots = graph.roots();
assert.equal(roots.length, 0);
});
test('root complex', function() {
graph.insertEdge('1', '2');
graph.insertEdge('1', '3');
graph.insertEdge('3', '4');
var roots = graph.roots();
assert.equal(roots.length, 2);
assert(['2', '4'].every(n => roots.some(node => node.data === n)));
});
});示例2: function
test('can remove nodes and get length', function() {
assert.equal(graph.length, 0);
assert.deepEqual(graph.lookup('ddd'), null);
assert.deepEqual(graph.lookupOrInsertNode('ddd').data, 'ddd');
assert.equal(graph.length, 1);
graph.removeNode('ddd');
assert.deepEqual(graph.lookup('ddd'), null);
assert.equal(graph.length, 0);
});