vis.js is a dynamic, browser-based visualization library
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1330 lines
44 KiB

  1. /**
  2. *
  3. * Useful during debugging
  4. * =======================
  5. *
  6. * console.log(JSON.stringify(output, null, 2));
  7. *
  8. * for (let i in network.body.edges) {
  9. * let edge = network.body.edges[i];
  10. * console.log("" + i + ": from: " + edge.fromId + ", to: " + edge.toId);
  11. * }
  12. */
  13. var fs = require('fs');
  14. var assert = require('assert');
  15. var vis = require('../dist/vis');
  16. var Network = vis.network;
  17. var jsdom_global = require('jsdom-global');
  18. var stdout = require('test-console').stdout;
  19. var Validator = require("./../lib/shared/Validator").default;
  20. var {allOptions, configureOptions} = require('./../lib/network/options.js');
  21. //var {printStyle} = require('./../lib/shared/Validator');
  22. /**
  23. * Merge all options of object b into object b
  24. * @param {Object} a
  25. * @param {Object} b
  26. * @return {Object} a
  27. *
  28. * Adapted merge() in dotparser.js
  29. */
  30. function merge (a, b) {
  31. if (!a) {
  32. a = {};
  33. }
  34. if (b) {
  35. for (var name in b) {
  36. if (b.hasOwnProperty(name)) {
  37. if (typeof b[name] === 'object') {
  38. a[name] = merge(a[name], b[name]);
  39. } else {
  40. a[name] = b[name];
  41. }
  42. }
  43. }
  44. }
  45. return a;
  46. }
  47. /**
  48. * Load legacy-style (i.e. not module) javascript files into the given context.
  49. */
  50. function include(list, context) {
  51. if (!(list instanceof Array)) {
  52. list = [list];
  53. }
  54. for (var n in list) {
  55. var path = list[n];
  56. var arr = [fs.readFileSync(path) + ''];
  57. eval.apply(context, arr);
  58. }
  59. }
  60. /**
  61. * Defined network consists of two sub-networks:
  62. *
  63. * - 1-2-3-4
  64. * - 11-12-13-14
  65. *
  66. * For reference, this is the sample network of issue #1218
  67. */
  68. function createSampleNetwork(options) {
  69. var NumInitialNodes = 8;
  70. var NumInitialEdges = 6;
  71. var nodes = new vis.DataSet([
  72. {id: 1, label: '1'},
  73. {id: 2, label: '2'},
  74. {id: 3, label: '3'},
  75. {id: 4, label: '4'},
  76. {id: 11, label: '11'},
  77. {id: 12, label: '12'},
  78. {id: 13, label: '13'},
  79. {id: 14, label: '14'},
  80. ]);
  81. var edges = new vis.DataSet([
  82. {from: 1, to: 2},
  83. {from: 2, to: 3},
  84. {from: 3, to: 4},
  85. {from: 11, to: 12},
  86. {from: 12, to: 13},
  87. {from: 13, to: 14},
  88. ]);
  89. // create a network
  90. var container = document.getElementById('mynetwork');
  91. var data = {
  92. nodes: nodes,
  93. edges: edges
  94. };
  95. var defaultOptions = {
  96. layout: {
  97. randomSeed: 8
  98. },
  99. edges: {
  100. smooth: {
  101. type: 'continuous' // avoid dynamic here, it adds extra hidden nodes
  102. }
  103. }
  104. };
  105. options = merge(defaultOptions, options);
  106. var network = new vis.Network(container, data, options);
  107. assertNumNodes(network, NumInitialNodes);
  108. assertNumEdges(network, NumInitialEdges);
  109. return [network, data, NumInitialNodes, NumInitialEdges];
  110. };
  111. /**
  112. * Create a cluster for the dynamic data change cases.
  113. *
  114. * Works on the network created by createSampleNetwork().
  115. *
  116. * This is actually a pathological case; there are two separate sub-networks and
  117. * a cluster is made of two nodes, each from one of the sub-networks.
  118. */
  119. function createCluster(network) {
  120. var clusterOptionsByData = {
  121. joinCondition: function(node) {
  122. if (node.id == 1 || node.id == 11) return true;
  123. return false;
  124. },
  125. clusterNodeProperties: {id:"c1", label:'c1'}
  126. }
  127. network.cluster(clusterOptionsByData);
  128. }
  129. /**
  130. * Display node/edge state, useful during debugging
  131. */
  132. function log(network) {
  133. console.log(Object.keys(network.body.nodes));
  134. console.log(network.body.nodeIndices);
  135. console.log(Object.keys(network.body.edges));
  136. console.log(network.body.edgeIndices);
  137. };
  138. /**
  139. * Note that only the node and edges counts are asserted.
  140. * This might be done more thoroughly by explicitly checking the id's
  141. */
  142. function assertNumNodes(network, expectedPresent, expectedVisible) {
  143. if (expectedVisible === undefined) expectedVisible = expectedPresent;
  144. assert.equal(Object.keys(network.body.nodes).length, expectedPresent, "Total number of nodes does not match");
  145. assert.equal(network.body.nodeIndices.length, expectedVisible, "Number of visible nodes does not match");
  146. };
  147. /**
  148. * Comment at assertNumNodes() also applies.
  149. */
  150. function assertNumEdges(network, expectedPresent, expectedVisible) {
  151. if (expectedVisible === undefined) expectedVisible = expectedPresent;
  152. assert.equal(Object.keys(network.body.edges).length, expectedPresent, "Total number of edges does not match");
  153. assert.equal(network.body.edgeIndices.length, expectedVisible, "Number of visible edges does not match");
  154. };
  155. /**
  156. * Check if the font options haven't changed.
  157. *
  158. * This is to guard against future code changes; a lot of the code deals with particular properties of
  159. * the font options.
  160. * If any assertion fails here, all code in Network handling fonts should be checked.
  161. */
  162. function checkFontProperties(fontItem, checkStrict = true) {
  163. var knownProperties = [
  164. 'color',
  165. 'size',
  166. 'face',
  167. 'background',
  168. 'strokeWidth',
  169. 'strokeColor',
  170. 'align',
  171. 'multi',
  172. 'vadjust',
  173. 'bold',
  174. 'boldital',
  175. 'ital',
  176. 'mono',
  177. ];
  178. // All properties in fontItem should be known
  179. for (var prop in fontItem) {
  180. if (prop === '__type__') continue; // Skip special field in options definition
  181. if (!fontItem.hasOwnProperty(prop)) continue;
  182. assert(knownProperties.indexOf(prop) !== -1, "Unknown font option '" + prop + "'");
  183. }
  184. if (!checkStrict) return;
  185. // All known properties should be present
  186. var keys = Object.keys(fontItem);
  187. for (var n in knownProperties) {
  188. var prop = knownProperties[n];
  189. assert(keys.indexOf(prop) !== -1, "Missing known font option '" + prop + "'");
  190. }
  191. }
  192. describe('Network', function () {
  193. before(function() {
  194. this.jsdom_global = jsdom_global(
  195. "<div id='mynetwork'></div>",
  196. { skipWindowCheck: true}
  197. );
  198. this.container = document.getElementById('mynetwork');
  199. });
  200. after(function() {
  201. try {
  202. this.jsdom_global();
  203. } catch(e) {
  204. if (e.message() === 'window is undefined') {
  205. console.warning("'" + e.message() + "' happened again");
  206. } else {
  207. throw e;
  208. }
  209. }
  210. });
  211. /////////////////////////////////////////////////////
  212. // Local helper methods for Edge and Node testing
  213. /////////////////////////////////////////////////////
  214. /**
  215. * Simplify network creation for local tests
  216. */
  217. function createNetwork(options) {
  218. var [network, data, numNodes, numEdges] = createSampleNetwork(options);
  219. return network;
  220. }
  221. function firstNode(network) {
  222. for (var id in network.body.nodes) {
  223. return network.body.nodes[id];
  224. }
  225. return undefined;
  226. }
  227. function firstEdge(network) {
  228. for (var id in network.body.edges) {
  229. return network.body.edges[id];
  230. }
  231. return undefined;
  232. }
  233. function checkChooserValues(item, chooser, labelChooser) {
  234. if (chooser === 'function') {
  235. assert.equal(typeof item.chooser, 'function');
  236. } else {
  237. assert.equal(item.chooser, chooser);
  238. }
  239. if (labelChooser === 'function') {
  240. assert.equal(typeof item.labelModule.fontOptions.chooser, 'function');
  241. } else {
  242. assert.equal(item.labelModule.fontOptions.chooser, labelChooser);
  243. }
  244. }
  245. /////////////////////////////////////////////////////
  246. // End Local helper methods for Edge and Node testing
  247. /////////////////////////////////////////////////////
  248. /**
  249. * Helper function for clustering
  250. */
  251. function clusterTo(network, clusterId, nodeList, allowSingle) {
  252. var options = {
  253. joinCondition: function(node) {
  254. return nodeList.indexOf(node.id) !== -1;
  255. },
  256. clusterNodeProperties: {
  257. id: clusterId,
  258. label: clusterId
  259. }
  260. }
  261. if (allowSingle === true) {
  262. options.clusterNodeProperties.allowSingleNodeCluster = true
  263. }
  264. network.cluster(options);
  265. }
  266. /**
  267. * At time of writing, this test detected 22 out of 33 'illegal' loops.
  268. * The real deterrent is eslint rule 'guard-for-in`.
  269. */
  270. it('can deal with added fields in Array.prototype', function (done) {
  271. Array.prototype.foo = 1; // Just add anything to the prototype
  272. Object.prototype.bar = 2; // Let's screw up hashes as well
  273. // The network should just run without throwing errors
  274. try {
  275. var [network, data, numNodes, numEdges] = createSampleNetwork({});
  276. // Do some stuff to trigger more errors
  277. clusterTo(network, 'c1', [1,2,3]);
  278. data.nodes.remove(1);
  279. network.openCluster('c1');
  280. clusterTo(network, 'c1', [4], true);
  281. clusterTo(network, 'c2', ['c1'], true);
  282. clusterTo(network, 'c3', ['c2'], true);
  283. data.nodes.remove(4);
  284. } catch(e) {
  285. delete Array.prototype.foo; // Remove it again so as not to confuse other tests.
  286. delete Object.prototype.bar;
  287. assert(false, "Got exception:\n" + e.stack);
  288. }
  289. delete Array.prototype.foo; // Remove it again so as not to confuse other tests.
  290. delete Object.prototype.bar;
  291. done();
  292. });
  293. /**
  294. * This is a fix on one issue (#3543), but in fact **all* options for all API calls should
  295. * remain unchanged.
  296. * TODO: extend test for all API calls with options, see #3548
  297. */
  298. it('does not change the options object passed to fit()', function() {
  299. var [network, data, numNodes, numEdges] = createSampleNetwork({});
  300. var options = {};
  301. network.fit(options);
  302. // options should still be empty
  303. for (var prop in options) {
  304. assert(!options.hasOwnProperty(prop), 'No properties should be present in options, detected property: ' + prop);
  305. }
  306. });
  307. describe('Node', function () {
  308. it('has known font options', function () {
  309. var network = createNetwork({});
  310. checkFontProperties(network.nodesHandler.defaultOptions.font);
  311. checkFontProperties(allOptions.nodes.font);
  312. checkFontProperties(configureOptions.nodes.font, false);
  313. });
  314. /**
  315. * NOTE: choosify tests of Node and Edge are parallel
  316. * TODO: consolidate this is necessary
  317. */
  318. it('properly handles choosify input', function () {
  319. // check defaults
  320. var options = {};
  321. var network = createNetwork(options);
  322. checkChooserValues(firstNode(network), true, true);
  323. // There's no point in checking invalid values here; these are detected by the options parser
  324. // and subsequently handled as missing input, thus assigned defaults
  325. // check various combinations of valid input
  326. options = {nodes: {chosen: false}};
  327. network = createNetwork(options);
  328. checkChooserValues(firstNode(network), false, false);
  329. options = {nodes: {chosen: { node:true, label:false}}};
  330. network = createNetwork(options);
  331. checkChooserValues(firstNode(network), true, false);
  332. options = {nodes: {chosen: {
  333. node:true,
  334. label: function(value, id, selected, hovering) {}
  335. }}};
  336. network = createNetwork(options);
  337. checkChooserValues(firstNode(network), true, 'function');
  338. options = {nodes: {chosen: {
  339. node: function(value, id, selected, hovering) {},
  340. label:false,
  341. }}};
  342. network = createNetwork(options);
  343. checkChooserValues(firstNode(network), 'function', false);
  344. });
  345. }); // Node
  346. describe('Edge', function () {
  347. it('has known font options', function () {
  348. var network = createNetwork({});
  349. checkFontProperties(network.edgesHandler.defaultOptions.font);
  350. checkFontProperties(allOptions.edges.font);
  351. checkFontProperties(configureOptions.edges.font, false);
  352. });
  353. /**
  354. * NOTE: choosify tests of Node and Edge are parallel
  355. * TODO: consolidate this is necessary
  356. */
  357. it('properly handles choosify input', function () {
  358. // check defaults
  359. var options = {};
  360. var network = createNetwork(options);
  361. checkChooserValues(firstEdge(network), true, true);
  362. // There's no point in checking invalid values here; these are detected by the options parser
  363. // and subsequently handled as missing input, thus assigned defaults
  364. // check various combinations of valid input
  365. options = {edges: {chosen: false}};
  366. network = createNetwork(options);
  367. checkChooserValues(firstEdge(network), false, false);
  368. options = {edges: {chosen: { edge:true, label:false}}};
  369. network = createNetwork(options);
  370. checkChooserValues(firstEdge(network), true, false);
  371. options = {edges: {chosen: {
  372. edge:true,
  373. label: function(value, id, selected, hovering) {}
  374. }}};
  375. network = createNetwork(options);
  376. checkChooserValues(firstEdge(network), true, 'function');
  377. options = {edges: {chosen: {
  378. edge: function(value, id, selected, hovering) {},
  379. label:false,
  380. }}};
  381. network = createNetwork(options);
  382. checkChooserValues(firstEdge(network), 'function', false);
  383. });
  384. /**
  385. * Support routine for next unit test
  386. */
  387. function createDataforColorChange() {
  388. var nodes = new vis.DataSet([
  389. {id: 1, label: 'Node 1' }, // group:'Group1'},
  390. {id: 2, label: 'Node 2', group:'Group2'},
  391. {id: 3, label: 'Node 3'},
  392. ]);
  393. // create an array with edges
  394. var edges = new vis.DataSet([
  395. {id: 1, from: 1, to: 2},
  396. {id: 2, from: 1, to: 3, color: { inherit: 'to'}},
  397. {id: 3, from: 3, to: 3, color: { color: '#00FF00'}},
  398. {id: 4, from: 2, to: 3, color: { inherit: 'from'}},
  399. ]);
  400. var data = {
  401. nodes: nodes,
  402. edges: edges
  403. };
  404. return data;
  405. }
  406. /**
  407. * Unit test for fix of #3350
  408. *
  409. * The issue is that changing color options is not registered in the nodes.
  410. * We test the updates the color options in the general edges options here.
  411. */
  412. it('sets inherit color option for edges on call to Network.setOptions()', function () {
  413. var container = document.getElementById('mynetwork');
  414. var data = createDataforColorChange();
  415. var options = {
  416. "edges" : { "color" : { "inherit" : "to" } },
  417. };
  418. // Test passing options on init.
  419. var network = new vis.Network(container, data, options);
  420. var edges = network.body.edges;
  421. assert.equal(edges[1].options.color.inherit, 'to'); // new default
  422. assert.equal(edges[2].options.color.inherit, 'to'); // set in edge
  423. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  424. assert.equal(edges[4].options.color.inherit, 'from'); // set in edge
  425. // Sanity check: colors should still be defaults
  426. assert.equal(edges[1].options.color.color, network.edgesHandler.options.color.color);
  427. // Override the color value - inherit returns to default
  428. network.setOptions({ edges:{color: {}}});
  429. assert.equal(edges[1].options.color.inherit, 'from'); // default
  430. assert.equal(edges[2].options.color.inherit, 'to'); // set in edge
  431. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  432. assert.equal(edges[4].options.color.inherit, 'from'); // set in edge
  433. // Check no options
  434. network = new vis.Network(container, data, {});
  435. edges = network.body.edges;
  436. assert.equal(edges[1].options.color.inherit, 'from'); // default
  437. assert.equal(edges[2].options.color.inherit, 'to'); // set in edge
  438. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  439. assert.equal(edges[4].options.color.inherit, 'from'); // set in edge
  440. // Set new value
  441. network.setOptions(options);
  442. assert.equal(edges[1].options.color.inherit, 'to');
  443. assert.equal(edges[2].options.color.inherit, 'to'); // set in edge
  444. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  445. assert.equal(edges[4].options.color.inherit, 'from'); // set in edge
  446. /*
  447. // Useful for debugging
  448. console.log('===================================');
  449. console.log(edges[1].options.color);
  450. console.log(edges[1].options.color.__proto__);
  451. console.log(edges[1].options);
  452. console.log(edges[1].options.__proto__);
  453. console.log(edges[1].edgeOptions);
  454. */
  455. });
  456. it('sets inherit color option for specific edge', function () {
  457. var container = document.getElementById('mynetwork');
  458. var data = createDataforColorChange();
  459. // Check no options
  460. var network = new vis.Network(container, data, {});
  461. var edges = network.body.edges;
  462. assert.equal(edges[1].options.color.inherit, 'from'); // default
  463. assert.equal(edges[2].options.color.inherit, 'to'); // set in edge
  464. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  465. assert.equal(edges[4].options.color.inherit, 'from'); // set in edge
  466. // Set new value
  467. data.edges.update({id: 1, color: { inherit: 'to'}});
  468. assert.equal(edges[1].options.color.inherit, 'to'); // Only this changed
  469. assert.equal(edges[2].options.color.inherit, 'to');
  470. assert.equal(edges[3].options.color.inherit, false); // has explicit color
  471. assert.equal(edges[4].options.color.inherit, 'from');
  472. });
  473. /**
  474. * Perhaps TODO: add unit test for passing string value for color option
  475. */
  476. it('sets color value for edges on call to Network.setOptions()', function () {
  477. var container = document.getElementById('mynetwork');
  478. var data = createDataforColorChange();
  479. var defaultColor = '#848484'; // From defaults
  480. var color = '#FF0000';
  481. var options = {
  482. "edges" : { "color" : { "color" : color } },
  483. };
  484. // Test passing options on init.
  485. var network = new vis.Network(container, data, options);
  486. var edges = network.body.edges;
  487. assert.equal(edges[1].options.color.color, color);
  488. assert.equal(edges[1].options.color.inherit, false); // Explicit color, so no inherit
  489. assert.equal(edges[2].options.color.color, color);
  490. assert.equal(edges[2].options.color.inherit, 'to'); // Local value overrides! (bug according to docs)
  491. assert.notEqual(edges[3].options.color.color, color); // Has own value
  492. assert.equal(edges[3].options.color.inherit, false); // Explicit color, so no inherit
  493. assert.equal(edges[4].options.color.color, color);
  494. // Override the color value - all should return to default
  495. network.setOptions({ edges:{color: {}}});
  496. assert.equal(edges[1].options.color.color, defaultColor);
  497. assert.equal(edges[1].options.color.inherit, 'from');
  498. assert.equal(edges[2].options.color.color, defaultColor);
  499. assert.notEqual(edges[3].options.color.color, color); // Has own value
  500. assert.equal(edges[4].options.color.color, defaultColor);
  501. // Check no options
  502. network = new vis.Network(container, data, {});
  503. edges = network.body.edges;
  504. // At this point, color has not changed yet
  505. assert.equal(edges[1].options.color.color, defaultColor);
  506. assert.equal(edges[1].options.color.highlight, defaultColor);
  507. assert.equal(edges[1].options.color.inherit, 'from');
  508. assert.notEqual(edges[3].options.color.color, color); // Has own value
  509. // Set new Value
  510. network.setOptions(options);
  511. assert.equal(edges[1].options.color.color, color);
  512. assert.equal(edges[1].options.color.highlight, defaultColor); // Should not be changed
  513. assert.equal(edges[1].options.color.inherit, false); // Explicit color, so no inherit
  514. assert.equal(edges[2].options.color.color, color);
  515. assert.notEqual(edges[3].options.color.color, color); // Has own value
  516. assert.equal(edges[4].options.color.color, color);
  517. });
  518. /**
  519. * Unit test for fix of #3500
  520. * Checking to make sure edges that become unconnected due to node removal get reconnected
  521. */
  522. it('has reconnected edges', function () {
  523. var node1 = {id:1, label:"test1"};
  524. var node2 = {id:2, label:"test2"};
  525. var nodes = new vis.DataSet([node1, node2]);
  526. var edge = {id:1, from: 1, to:2};
  527. var edges = new vis.DataSet([edge]);
  528. var data = {
  529. nodes: nodes,
  530. edges: edges
  531. };
  532. var container = document.getElementById('mynetwork');
  533. var network = new vis.Network(container, data);
  534. //remove node causing edge to become disconnected
  535. nodes.remove(node2.id);
  536. var foundEdge = network.body.edges[edge.id];
  537. assert.ok(foundEdge===undefined, "edge is still in state cache");
  538. //add node back reconnecting edge
  539. nodes.add(node2);
  540. foundEdge = network.body.edges[edge.id];
  541. assert.ok(foundEdge!==undefined, "edge is missing from state cache");
  542. });
  543. }); // Edge
  544. describe('Clustering', function () {
  545. it('properly handles options allowSingleNodeCluster', function() {
  546. var [network, data, numNodes, numEdges] = createSampleNetwork();
  547. data.edges.update({from: 1, to: 11,});
  548. numEdges += 1;
  549. assertNumNodes(network, numNodes);
  550. assertNumEdges(network, numEdges);
  551. clusterTo(network, 'c1', [3,4]);
  552. numNodes += 1; // A clustering node is now hiding two nodes
  553. numEdges += 1; // One clustering edges now hiding two edges
  554. assertNumNodes(network, numNodes, numNodes - 2);
  555. assertNumEdges(network, numEdges, numEdges - 2);
  556. // Cluster of single node should fail, because by default allowSingleNodeCluster == false
  557. clusterTo(network, 'c2', [14]);
  558. assertNumNodes(network, numNodes, numNodes - 2); // Nothing changed
  559. assertNumEdges(network, numEdges, numEdges - 2);
  560. assert(network.body.nodes['c2'] === undefined); // Cluster not created
  561. // Redo with allowSingleNodeCluster == true
  562. clusterTo(network, 'c2', [14], true);
  563. numNodes += 1;
  564. numEdges += 1;
  565. assertNumNodes(network, numNodes, numNodes - 3);
  566. assertNumEdges(network, numEdges, numEdges - 3);
  567. assert(network.body.nodes['c2'] !== undefined); // Cluster created
  568. // allowSingleNodeCluster: true with two nodes
  569. // removing one clustered node should retain cluster
  570. clusterTo(network, 'c3', [11, 12], true);
  571. numNodes += 1; // Added cluster
  572. numEdges += 2;
  573. assertNumNodes(network, numNodes, 6);
  574. assertNumEdges(network, numEdges, 5);
  575. data.nodes.remove(12);
  576. assert(network.body.nodes['c3'] !== undefined); // Cluster should still be present
  577. numNodes -= 1; // removed node
  578. numEdges -= 3; // cluster edge C3-13 should be removed
  579. assertNumNodes(network, numNodes, 6);
  580. assertNumEdges(network, numEdges, 4);
  581. });
  582. it('removes nested clusters with allowSingleNodeCluster === true', function() {
  583. var [network, data, numNodes, numEdges] = createSampleNetwork();
  584. // Create a chain of nested clusters, three deep
  585. clusterTo(network, 'c1', [4], true);
  586. clusterTo(network, 'c2', ['c1'], true);
  587. clusterTo(network, 'c3', ['c2'], true);
  588. numNodes += 3;
  589. numEdges += 3;
  590. assertNumNodes(network, numNodes, numNodes - 3);
  591. assertNumEdges(network, numEdges, numEdges - 3);
  592. assert(network.body.nodes['c1'] !== undefined);
  593. assert(network.body.nodes['c2'] !== undefined);
  594. assert(network.body.nodes['c3'] !== undefined);
  595. // The whole chain should be removed when the bottom-most node is deleted
  596. data.nodes.remove(4);
  597. numNodes -= 4;
  598. numEdges -= 4;
  599. assertNumNodes(network, numNodes);
  600. assertNumEdges(network, numEdges);
  601. assert(network.body.nodes['c1'] === undefined);
  602. assert(network.body.nodes['c2'] === undefined);
  603. assert(network.body.nodes['c3'] === undefined);
  604. });
  605. /**
  606. * Check on fix for #1218
  607. */
  608. it('connects a new edge to a clustering node instead of the clustered node', function () {
  609. var [network, data, numNodes, numEdges] = createSampleNetwork();
  610. createCluster(network);
  611. numNodes += 1; // A clustering node is now hiding two nodes
  612. numEdges += 2; // Two clustering edges now hide two edges
  613. assertNumNodes(network, numNodes, numNodes - 2);
  614. assertNumEdges(network, numEdges, numEdges - 2);
  615. //console.log("Creating node 21")
  616. data.nodes.update([{id: 21, label: '21'}]);
  617. numNodes += 1; // New unconnected node added
  618. assertNumNodes(network, numNodes, numNodes - 2);
  619. assertNumEdges(network, numEdges, numEdges - 2); // edges unchanged
  620. //console.log("Creating edge 21 pointing to 1");
  621. // '1' is part of the cluster so should
  622. // connect to cluster instead
  623. data.edges.update([{from: 21, to: 1}]);
  624. numEdges += 2; // A new clustering edge is hiding a new edge
  625. assertNumNodes(network, numNodes, numNodes - 2); // nodes unchanged
  626. assertNumEdges(network, numEdges, numEdges - 3);
  627. });
  628. /**
  629. * Check on fix for #1315
  630. */
  631. it('can uncluster a clustered node when a node is removed that has an edge to that cluster', function () {
  632. // NOTE: this block is same as previous test
  633. var [network, data, numNodes, numEdges] = createSampleNetwork();
  634. createCluster(network);
  635. numNodes += 1; // A clustering node is now hiding two nodes
  636. numEdges += 2; // Two clustering edges now hide two edges
  637. assertNumNodes(network, numNodes, numNodes - 2);
  638. assertNumEdges(network, numEdges, numEdges - 2);
  639. // End block same as previous test
  640. //console.log("removing 12");
  641. data.nodes.remove(12);
  642. // NOTE:
  643. // At this particular point, there are still the two edges for node 12 in the edges DataSet.
  644. // If you want to do the delete correctly, these should also be deleted explictly from
  645. // the edges DataSet. In the Network instance, however, this.body.nodes and this.body.edges
  646. // should be correct, with the edges of 12 all cleared out.
  647. // 12 was connected to 11, which is clustered
  648. numNodes -= 1; // 12 removed, one less node
  649. numEdges -= 3; // clustering edge c1-12 and 2 edges of 12 gone
  650. assertNumNodes(network, numNodes, numNodes - 2);
  651. assertNumEdges(network, numEdges, numEdges - 1);
  652. //console.log("Unclustering c1");
  653. network.openCluster("c1");
  654. numNodes -= 1; // cluster node removed, one less node
  655. numEdges -= 1; // clustering edge gone, regular edge visible
  656. assertNumNodes(network, numNodes, numNodes); // all are visible again
  657. assertNumEdges(network, numEdges, numEdges); // all are visible again
  658. });
  659. /**
  660. * Check on fix for #1291
  661. */
  662. it('can remove a node inside a cluster and then open that cluster', function () {
  663. var [network, data, numNodes, numEdges] = createSampleNetwork();
  664. var clusterOptionsByData = {
  665. joinCondition: function(node) {
  666. if (node.id == 1 || node.id == 2 || node.id == 3) return true;
  667. return false;
  668. },
  669. clusterNodeProperties: {id:"c1", label:'c1'}
  670. }
  671. network.cluster(clusterOptionsByData);
  672. numNodes += 1; // new cluster node
  673. numEdges += 1; // 1 cluster edge expected
  674. assertNumNodes(network, numNodes, numNodes - 3); // 3 clustered nodes
  675. assertNumEdges(network, numEdges, numEdges - 3); // 3 edges hidden
  676. //console.log("removing node 2, which is inside the cluster");
  677. data.nodes.remove(2);
  678. numNodes -= 1; // clustered node removed
  679. numEdges -= 2; // edges removed hidden in cluster
  680. assertNumNodes(network, numNodes, numNodes - 2); // view doesn't change
  681. assertNumEdges(network, numEdges, numEdges - 1); // view doesn't change
  682. //console.log("Unclustering c1");
  683. network.openCluster("c1")
  684. numNodes -= 1; // cluster node gone
  685. numEdges -= 1; // cluster edge gone
  686. assertNumNodes(network, numNodes, numNodes); // all visible
  687. assertNumEdges(network, numEdges, numEdges); // all visible
  688. //log(network);
  689. });
  690. /**
  691. * Helper function for setting up a graph for testing clusterByEdgeCount()
  692. */
  693. function createOutlierGraph() {
  694. // create an array with nodes
  695. var nodes = new vis.DataSet([
  696. {id: 1, label: '1', group:'Group1'},
  697. {id: 2, label: '2', group:'Group2'},
  698. {id: 3, label: '3', group:'Group3'},
  699. {id: 4, label: '4', group:'Group4'},
  700. {id: 5, label: '5', group:'Group4'}
  701. ]);
  702. // create an array with edges
  703. var edges = new vis.DataSet([
  704. {from: 1, to: 3},
  705. {from: 1, to: 2},
  706. {from: 2, to: 4},
  707. {from: 2, to: 5}
  708. ]);
  709. // create a network
  710. var container = document.getElementById('mynetwork');
  711. var data = {
  712. nodes: nodes,
  713. edges: edges
  714. };
  715. var options = {
  716. "groups" : {
  717. "Group1" : { level:1 },
  718. "Group2" : { level:2 },
  719. "Group3" : { level:3 },
  720. "Group4" : { level:4 }
  721. }
  722. };
  723. var network = new vis.Network (container, data, options);
  724. return network;
  725. }
  726. /**
  727. * Check on fix for #3367
  728. */
  729. it('correctly handles edge cases of clusterByEdgeCount()', function () {
  730. /**
  731. * Collect clustered id's
  732. *
  733. * All node id's in clustering nodes are collected into an array;
  734. * The results for all clusters are returned as an array.
  735. *
  736. * Ordering of output depends on the order in which they are defined
  737. * within nodes.clustering; strictly, speaking, the array and its items
  738. * are collections, so order should not matter.
  739. */
  740. var collectClusters = function(network) {
  741. var clusters = [];
  742. for(var n in network.body.nodes) {
  743. var node = network.body.nodes[n];
  744. if (node.containedNodes === undefined) continue; // clusters only
  745. // Collect id's of nodes in the cluster
  746. var nodes = [];
  747. for(var m in node.containedNodes) {
  748. nodes.push(m);
  749. }
  750. clusters.push(nodes);
  751. }
  752. return clusters;
  753. }
  754. /**
  755. * Compare cluster data
  756. *
  757. * params are arrays of arrays of id's, e.g:
  758. *
  759. * [[1,3],[2,4]]
  760. *
  761. * Item arrays are the id's of nodes in a given cluster
  762. *
  763. * This comparison depends on the ordering; better
  764. * would be to treat the items and values as collections.
  765. */
  766. var compareClusterInfo = function(recieved, expected) {
  767. if (recieved.length !== expected.length) return false;
  768. for (var n = 0; n < recieved.length; ++n) {
  769. var itema = recieved[n];
  770. var itemb = expected[n];
  771. if (itema.length !== itemb.length) return false;
  772. for (var m = 0; m < itema.length; ++m) {
  773. if (itema[m] != itemb[m]) return false; // != because values can be string or number
  774. }
  775. }
  776. return true;
  777. }
  778. var assertJoinCondition = function(joinCondition, expected) {
  779. var network = createOutlierGraph();
  780. network.clusterOutliers({joinCondition: joinCondition});
  781. var recieved = collectClusters(network);
  782. //console.log(recieved);
  783. assert(compareClusterInfo(recieved, expected),
  784. 'recieved:' + JSON.stringify(recieved) + '; '
  785. + 'expected: ' + JSON.stringify(expected));
  786. };
  787. // Should cluster 3,4,5:
  788. var joinAll_ = function(n) { return true ; }
  789. // Should cluster none:
  790. var joinNone_ = function(n) { return false ; }
  791. // Should cluster 4 & 5:
  792. var joinLevel_ = function(n) { return n.level > 3 ; }
  793. assertJoinCondition(undefined , [[1,3],[2,4,5]]);
  794. assertJoinCondition(null , [[1,3],[2,4,5]]);
  795. assertJoinCondition(joinNone_ , []);
  796. assertJoinCondition(joinLevel_ , [[2,4,5]]);
  797. });
  798. ///////////////////////////////////////////////////////////////
  799. // Automatic opening of clusters due to dynamic data change
  800. ///////////////////////////////////////////////////////////////
  801. /**
  802. * Helper function, created nested clusters, three deep
  803. */
  804. function createNetwork1() {
  805. var [network, data, numNodes, numEdges] = createSampleNetwork();
  806. clusterTo(network, 'c1', [3,4]);
  807. numNodes += 1; // new cluster node
  808. numEdges += 1; // 1 cluster edge expected
  809. assertNumNodes(network, numNodes, numNodes - 2); // 2 clustered nodes
  810. assertNumEdges(network, numEdges, numEdges - 2); // 2 edges hidden
  811. clusterTo(network, 'c2', [2,'c1']);
  812. numNodes += 1; // new cluster node
  813. numEdges += 1; // 2 cluster edges expected
  814. assertNumNodes(network, numNodes, numNodes - 4); // 4 clustered nodes, including c1
  815. assertNumEdges(network, numEdges, numEdges - 4); // 4 edges hidden, including edge for c1
  816. clusterTo(network, 'c3', [1,'c2']);
  817. // Attempt at visualization: parentheses belong to the cluster one level above
  818. // c3
  819. // ( -c2 )
  820. // ( -c1 )
  821. // 14-13-12-11 1 -2 (-3-4)
  822. numNodes += 1; // new cluster node
  823. numEdges += 0; // No new cluster edge expected
  824. assertNumNodes(network, numNodes, numNodes - 6); // 6 clustered nodes, including c1 and c2
  825. assertNumEdges(network, numEdges, numEdges - 5); // 5 edges hidden, including edges for c1 and c2
  826. return [network, data, numNodes, numEdges];
  827. }
  828. it('opens clusters automatically when nodes deleted', function () {
  829. var [network, data, numNodes, numEdges] = createSampleNetwork();
  830. // Simple case: cluster of two nodes, delete one node
  831. clusterTo(network, 'c1', [3,4]);
  832. numNodes += 1; // new cluster node
  833. numEdges += 1; // 1 cluster edge expected
  834. assertNumNodes(network, numNodes, numNodes - 2); // 2 clustered nodes
  835. assertNumEdges(network, numEdges, numEdges - 2); // 2 edges hidden
  836. data.nodes.remove(4);
  837. numNodes -= 2; // deleting clustered node also removes cluster node
  838. numEdges -= 2; // cluster edge should also be removed
  839. assertNumNodes(network, numNodes, numNodes);
  840. assertNumEdges(network, numEdges, numEdges);
  841. // Extended case: nested nodes, three deep
  842. [network, data, numNodes, numEdges] = createNetwork1();
  843. data.nodes.remove(4);
  844. // c3
  845. // ( -c2 )
  846. // 14-13-12-11 1 (-2 -3)
  847. numNodes -= 2; // node removed, c1 also gone
  848. numEdges -= 2;
  849. assertNumNodes(network, numNodes, numNodes - 4);
  850. assertNumEdges(network, numEdges, numEdges - 3);
  851. data.nodes.remove(1);
  852. // c2
  853. // 14-13-12-11 (2 -3)
  854. numNodes -= 2; // node removed, c3 also gone
  855. numEdges -= 2;
  856. assertNumNodes(network, numNodes, numNodes - 2);
  857. assertNumEdges(network, numEdges, numEdges - 1);
  858. data.nodes.remove(2);
  859. // 14-13-12-11 3
  860. numNodes -= 2; // node removed, c2 also gone
  861. numEdges -= 1;
  862. assertNumNodes(network, numNodes); // All visible again
  863. assertNumEdges(network, numEdges);
  864. // Same as previous step, but remove all the given nodes in one go
  865. // The result should be the same.
  866. [network, data, numNodes, numEdges] = createNetwork1(); // nested nodes, three deep
  867. data.nodes.remove([1,2,4]);
  868. // 14-13-12-11 3
  869. assertNumNodes(network, 5);
  870. assertNumEdges(network, 3);
  871. });
  872. ///////////////////////////////////////////////////////////////
  873. // Opening of clusters at various clustering depths
  874. ///////////////////////////////////////////////////////////////
  875. /**
  876. * Check correct opening of a single cluster.
  877. * This is the 'simple' case.
  878. */
  879. it('properly opens 1-level clusters', function () {
  880. var [network, data, numNodes, numEdges] = createSampleNetwork();
  881. // Pedantic: make a cluster of everything
  882. clusterTo(network, 'c1', [1,2,3,4,11, 12, 13, 14]);
  883. // c1(14-13-12-11 1-2-3-4)
  884. numNodes += 1;
  885. assertNumNodes(network, numNodes, 1); // Just the clustering node visible
  886. assertNumEdges(network, numEdges, 0); // No extra edges!
  887. network.clustering.openCluster('c1', {});
  888. numNodes -= 1;
  889. assertNumNodes(network, numNodes, numNodes); // Expecting same as original
  890. assertNumEdges(network, numEdges, numEdges);
  891. // One external connection
  892. [network, data, numNodes, numEdges] = createSampleNetwork();
  893. // 14-13-12-11 1-2-3-4
  894. clusterTo(network, 'c1', [3,4]);
  895. network.clustering.openCluster('c1', {});
  896. assertNumNodes(network, numNodes, numNodes); // Expecting same as original
  897. assertNumEdges(network, numEdges, numEdges);
  898. // Two external connections
  899. clusterTo(network, 'c1', [2,3]);
  900. network.clustering.openCluster('c1', {});
  901. assertNumNodes(network, numNodes, numNodes); // Expecting same as original
  902. assertNumEdges(network, numEdges, numEdges);
  903. // One external connection to cluster
  904. clusterTo(network, 'c1', [1,2]);
  905. clusterTo(network, 'c2', [3,4]);
  906. // 14-13-12-11 c1(1-2-)-c2(-3-4)
  907. network.clustering.openCluster('c1', {});
  908. // 14-13-12-11 1-2-c2(-3-4)
  909. numNodes += 1;
  910. numEdges += 1;
  911. assertNumNodes(network, numNodes, numNodes - 2);
  912. assertNumEdges(network, numEdges, numEdges - 2);
  913. // two external connections to clusters
  914. [network, data, numNodes, numEdges] = createSampleNetwork();
  915. data.edges.update({
  916. from: 1,
  917. to: 11,
  918. });
  919. numEdges += 1;
  920. assertNumNodes(network, numNodes, numNodes);
  921. assertNumEdges(network, numEdges, numEdges);
  922. clusterTo(network, 'c1', [1,2]);
  923. // 14-13-12-11-c1(-1-2-)-3-4
  924. numNodes += 1;
  925. numEdges += 2;
  926. clusterTo(network, 'c2', [3,4]);
  927. // 14-13-12-11-c1(-1-2-)-c2(-3-4)
  928. // NOTE: clustering edges are hidden by clustering here!
  929. numNodes += 1;
  930. numEdges += 1;
  931. clusterTo(network, 'c3', [11,12]);
  932. // 14-13-c3(-12-11-)-c1(-1-2-)-c2(-3-4)
  933. numNodes += 1;
  934. numEdges += 2;
  935. assertNumNodes(network, numNodes, numNodes - 6);
  936. assertNumEdges(network, numEdges, numEdges - 8); // 6 regular edges hidden; also 2 clustering!!!!!
  937. network.clustering.openCluster('c1', {});
  938. numNodes -= 1;
  939. numEdges -= 2;
  940. // 14-13-c3(-12-11-)-1-2-c2(-3-4)
  941. assertNumNodes(network, numNodes, numNodes - 4);
  942. assertNumEdges(network, numEdges, numEdges - 5);
  943. });
  944. /**
  945. * Check correct opening of nested clusters.
  946. * The test uses clustering three levels deep and opens the middle one.
  947. */
  948. it('properly opens clustered clusters', function () {
  949. var [network, data, numNodes, numEdges] = createSampleNetwork();
  950. data.edges.update({from: 1, to: 11,});
  951. numEdges += 1;
  952. clusterTo(network, 'c1', [3,4]);
  953. clusterTo(network, 'c2', [2,'c1']);
  954. clusterTo(network, 'c3', [1,'c2']);
  955. // Attempt at visualization: parentheses belong to the cluster one level above
  956. // -c3
  957. // ( -c2 )
  958. // ( -c1 )
  959. // 14-13-12-11 -1 -2 (-3-4)
  960. numNodes += 3;
  961. numEdges += 3;
  962. //console.log("numNodes: " + numNodes + "; numEdges: " + numEdges);
  963. assertNumNodes(network, numNodes, numNodes - 6);
  964. assertNumEdges(network, numEdges, numEdges - 6);
  965. // Open the middle cluster
  966. network.clustering.openCluster('c2', {});
  967. // -c3
  968. // ( -c1 )
  969. // 14-13-12-11 -1 -2 (-3-4)
  970. numNodes -= 1;
  971. numEdges -= 1;
  972. assertNumNodes(network, numNodes, numNodes - 5);
  973. assertNumEdges(network, numEdges, numEdges - 5);
  974. //
  975. // Same, with one external connection to cluster
  976. //
  977. var [network, data, numNodes, numEdges] = createSampleNetwork();
  978. data.edges.update({from: 1, to: 11,});
  979. data.edges.update({from: 2, to: 12,});
  980. numEdges += 2;
  981. // 14-13-12-11-1-2-3-4
  982. // |------|
  983. assertNumNodes(network, numNodes);
  984. assertNumEdges(network, numEdges);
  985. clusterTo(network, 'c0', [11,12]);
  986. clusterTo(network, 'c1', [3,4]);
  987. clusterTo(network, 'c2', [2,'c1']);
  988. clusterTo(network, 'c3', [1,'c2']);
  989. // +----------------+
  990. // | c3 |
  991. // | +----------+ |
  992. // | | c2 | |
  993. // +-------+ | | +----+ | |
  994. // | c0 | | | | c1 | | |
  995. // 14-13-|-12-11-|-|-1-|-2-|-3-4| | |
  996. // | | | | | | +----+ | |
  997. // +-------+ | | | | |
  998. // | | +----------+ |
  999. // | | | |
  1000. // | +----------------+
  1001. // |------------|
  1002. // (I)
  1003. numNodes += 4;
  1004. numEdges = 15;
  1005. assertNumNodes(network, numNodes, 4);
  1006. assertNumEdges(network, numEdges, 3); // (I) link 2-12 is combined into cluster edge for 11-1
  1007. // Open the middle cluster
  1008. network.clustering.openCluster('c2', {});
  1009. // +--------------+
  1010. // | c3 |
  1011. // | |
  1012. // +-------+ | +----+ |
  1013. // | c0 | | | c1 | |
  1014. // 14-13-|-12-11-|-|-1--2-|-3-4| |
  1015. // | | | | | +----+ |
  1016. // +-------+ | | |
  1017. // | | | |
  1018. // | +--------------+
  1019. // |-----------|
  1020. // (I)
  1021. numNodes -= 1;
  1022. numEdges -= 2;
  1023. assertNumNodes(network, numNodes, 4); // visibility doesn't change, cluster opened within cluster
  1024. assertNumEdges(network, numEdges, 3); // (I)
  1025. // Open the top cluster
  1026. network.clustering.openCluster('c3', {});
  1027. //
  1028. // +-------+ +----+
  1029. // | c0 | | c1 |
  1030. // 14-13-|-12-11-|-1-2-|-3-4|
  1031. // | | | | +----+
  1032. // +-------+ |
  1033. // | |
  1034. // |--------|
  1035. // (II)
  1036. numNodes -= 1;
  1037. numEdges = 12;
  1038. assertNumNodes(network, numNodes, 6); // visibility doesn't change, cluster opened within cluster
  1039. assertNumEdges(network, numEdges, 6); // (II) link 2-12 visible again
  1040. });
  1041. }); // Clustering
  1042. describe('on node.js', function () {
  1043. it('should be running', function () {
  1044. assert(this.container !== null, 'Container div not found');
  1045. // The following should now just plain succeed
  1046. var [network, data] = createSampleNetwork();
  1047. assert.equal(Object.keys(network.body.nodes).length, 8);
  1048. assert.equal(Object.keys(network.body.edges).length, 6);
  1049. });
  1050. describe('runs example ', function () {
  1051. function loadExample(path, noPhysics) {
  1052. include(path, this);
  1053. var container = document.getElementById('mynetwork');
  1054. // create a network
  1055. var data = {
  1056. nodes: new vis.DataSet(nodes),
  1057. edges: new vis.DataSet(edges)
  1058. };
  1059. if (noPhysics) {
  1060. // Avoid excessive processor time due to load.
  1061. // We're just interested that the load itself is good
  1062. options.physics = false;
  1063. }
  1064. var network = new vis.Network(container, data, options);
  1065. return network;
  1066. };
  1067. it('basicUsage', function () {
  1068. var network = loadExample('./test/network/basicUsage.js');
  1069. //console.log(Object.keys(network.body.edges));
  1070. // Count in following also contains the helper nodes for dynamic edges
  1071. assert.equal(Object.keys(network.body.nodes).length, 10);
  1072. assert.equal(Object.keys(network.body.edges).length, 5);
  1073. });
  1074. it('WorlCup2014', function (done) {
  1075. // This is a huge example (which is why it's tested here!), so it takes a long time to load.
  1076. this.timeout(15000);
  1077. var network = loadExample('./examples/network/datasources/WorldCup2014.js', true);
  1078. // Count in following also contains the helper nodes for dynamic edges
  1079. assert.equal(Object.keys(network.body.nodes).length, 9964);
  1080. assert.equal(Object.keys(network.body.edges).length, 9228);
  1081. done();
  1082. });
  1083. // This actually failed to load, added for this reason
  1084. it('disassemblerExample', function () {
  1085. var network = loadExample('./examples/network/exampleApplications/disassemblerExample.js');
  1086. // console.log(Object.keys(network.body.nodes));
  1087. // console.log(Object.keys(network.body.edges));
  1088. // Count in following also contains the helper nodes for dynamic edges
  1089. assert.equal(Object.keys(network.body.nodes).length, 9);
  1090. assert.equal(Object.keys(network.body.edges).length, 14 - 3); // NB 3 edges in data not displayed
  1091. });
  1092. }); // runs example
  1093. }); // on node.js
  1094. }); // Network