Browse Source

updated to SNAPSHOT 4.8.3

webworkersNetwork
Alex de Mulder 9 years ago
parent
commit
0ec249ff5c
3 changed files with 15 additions and 6 deletions
  1. +4
    -0
      HISTORY.md
  2. +7
    -4
      dist/vis.js
  3. +4
    -2
      lib/network/modules/components/algorithms/FloydWarshall.js

+ 4
- 0
HISTORY.md View File

@ -3,6 +3,10 @@ http://visjs.org
## NOT YET RELEASED, version 4.8.3
### Network
- Fixed bug where an edge that was not connected would crash the layout algorithms.
## 2015-09-14, version 4.8.2
### Network

+ 7
- 4
dist/vis.js View File

@ -4,8 +4,8 @@
*
* A dynamic, browser-based visualization library.
*
* @version 4.8.2
* @date 2015-09-14
* @version 4.8.3-SNAPSHOT
* @date 2015-09-17
*
* @license
* Copyright (C) 2011-2015 Almende B.V, http://almende.com
@ -41787,8 +41787,11 @@ return /******/ (function(modules) { // webpackBootstrap
// put the weights for the edges in. This assumes unidirectionality.
for (var i = 0; i < edgesArray.length; i++) {
var edge = edges[edgesArray[i]];
D_matrix[edge.fromId][edge.toId] = 1;
D_matrix[edge.toId][edge.fromId] = 1;
if (edge.connected === true) {
// edge has to be connected if it counts to the distances.
D_matrix[edge.fromId][edge.toId] = 1;
D_matrix[edge.toId][edge.fromId] = 1;
}
}
var nodeCount = nodesArray.length;

+ 4
- 2
lib/network/modules/components/algorithms/FloydWarshall.js View File

@ -23,8 +23,10 @@ class FloydWarshall {
// put the weights for the edges in. This assumes unidirectionality.
for (let i = 0; i < edgesArray.length; i++) {
let edge = edges[edgesArray[i]];
D_matrix[edge.fromId][edge.toId] = 1;
D_matrix[edge.toId][edge.fromId] = 1;
if (edge.connected === true) { // edge has to be connected if it counts to the distances.
D_matrix[edge.fromId][edge.toId] = 1;
D_matrix[edge.toId][edge.fromId] = 1;
}
}
let nodeCount = nodesArray.length;

Loading…
Cancel
Save