cytoscape
Advanced tools
Comparing version 3.23.0 to 3.24.0
@@ -15,4 +15,6 @@ --- | ||
If your issue pertains to an extension, your issue should be filed in that extension's repository -- not here. | ||
**Environment info** | ||
@@ -19,0 +21,0 @@ |
{ | ||
"name": "cytoscape", | ||
"version": "3.23.0", | ||
"version": "3.24.0", | ||
"license": "MIT", | ||
@@ -5,0 +5,0 @@ "description": "Graph theory (a.k.a. network) library for analysis and visualisation", |
@@ -65,3 +65,3 @@ <img style="width: 200px; height: 200px;" src="https://raw.githubusercontent.com/cytoscape/cytoscape.js/unstable/documentation/img/cytoscape-logo.png" width="200" height="200"></img> | ||
For the mechanics of contributing a pull request, refer to [CONTRIBUTING.md](.github/CONTRIBUTING.md). | ||
For the mechanics of contributing a pull request, refer to [CONTRIBUTING.md](CONTRIBUTING.md). | ||
@@ -68,0 +68,0 @@ Feature releases are made monthly, while patch releases are made weekly. This allows for rapid releases of first- and third-party contributions. |
@@ -287,3 +287,3 @@ // Implemented by Zoe Xi @zoexi for GSOC 2016 | ||
isStillMoving = false; | ||
// Step 3: For each medoid m, and for each node assciated with mediod m, | ||
// Step 3: For each medoid m, and for each node associated with mediod m, | ||
// select the node with the lowest configuration cost as new medoid. | ||
@@ -290,0 +290,0 @@ for ( let m = 0; m < medoids.length; m++ ) { |
@@ -17,3 +17,2 @@ import * as util from '../../util'; | ||
roots: undefined, // the roots of the trees | ||
maximal: false, // whether to shift nodes down their natural BFS depths in order to avoid upwards edges (DAGS only) | ||
depthSort: undefined, // a sorting function to order nodes at equal depth. e.g. function(a, b){ return a.data('weight') - b.data('weight') } | ||
@@ -28,2 +27,8 @@ animate: false, // whether to transition the node positions | ||
}; | ||
const deprecatedOptionDefaults = { | ||
maximal: false, // whether to shift nodes down their natural BFS depths in order to avoid upwards edges (DAGS only); setting acyclic to true sets maximal to true also | ||
acyclic: false, // whether the tree is acyclic and thus a node could be shifted (due to the maximal option) multiple times without causing an infinite loop; setting to true sets maximal to true also; if you are uncertain whether a tree is acyclic, set to false to avoid potential infinite loops | ||
}; | ||
/* eslint-enable */ | ||
@@ -35,3 +40,3 @@ | ||
function BreadthFirstLayout( options ){ | ||
this.options = util.extend( {}, defaults, options ); | ||
this.options = util.extend( {}, defaults, deprecatedOptionDefaults, options ); | ||
} | ||
@@ -48,3 +53,3 @@ | ||
let directed = options.directed; | ||
let maximal = options.maximal || options.maximalAdjustments > 0; // maximalAdjustments for compat. w/ old code | ||
let maximal = options.acyclic || options.maximal || options.maximalAdjustments > 0; // maximalAdjustments for compat. w/ old code; also, setting acyclic to true sets maximal to true | ||
@@ -183,8 +188,9 @@ let bb = math.makeBoundingBox( options.boundingBox ? options.boundingBox : { | ||
if( eInfo.depth <= maxDepth ){ | ||
if( shifted[id] ){ | ||
if( !options.acyclic && shifted[id] ){ | ||
return null; | ||
} | ||
changeDepth( ele, maxDepth + 1 ); | ||
shifted[id] = true; | ||
let newDepth = maxDepth + 1; | ||
changeDepth( ele, newDepth ); | ||
shifted[id] = newDepth; | ||
@@ -191,0 +197,0 @@ return true; |
@@ -481,3 +481,3 @@ /* | ||
* @return : object of the form {count: X, graph: Y}, where: | ||
* X is the number of ancesters (max: 2) found in | ||
* X is the number of ancestors (max: 2) found in | ||
* graphIx (and it's subgraphs), | ||
@@ -484,0 +484,0 @@ * Y is the graph index of the lowest graph containing |
@@ -27,2 +27,4 @@ var BRp = {}; | ||
if( !isDataUri ){ | ||
// if crossorigin is 'null'(stringified), then manually set it to null | ||
crossOrigin = crossOrigin === 'null' ? null : crossOrigin; | ||
image.crossOrigin = crossOrigin; // prevent tainted canvas | ||
@@ -29,0 +31,0 @@ } |
@@ -1696,3 +1696,3 @@ import * as is from '../../../is'; | ||
r.redraw(); | ||
} else { // otherise keep track of drag delta for later | ||
} else { // otherwise keep track of drag delta for later | ||
var dragDelta = r.touchData.dragDelta = r.touchData.dragDelta || []; | ||
@@ -1699,0 +1699,0 @@ |
@@ -365,3 +365,3 @@ import * as util from '../../../util'; | ||
if( offset < 0 ){ | ||
// then the layer has nonexistant elements and is invalid | ||
// then the layer has nonexistent elements and is invalid | ||
this.invalidateLayer( layer ); | ||
@@ -368,0 +368,0 @@ continue; |
@@ -49,3 +49,3 @@ import * as util from '../util'; | ||
bgFit: { enums: [ 'none', 'contain', 'cover' ], multiple: true }, | ||
bgCrossOrigin: { enums: [ 'anonymous', 'use-credentials' ], multiple: true }, | ||
bgCrossOrigin: { enums: [ 'anonymous', 'use-credentials', 'null' ], multiple: true }, | ||
bgClip: { enums: [ 'none', 'node' ], multiple: true }, | ||
@@ -52,0 +52,0 @@ bgContainment: { enums: [ 'inside', 'over' ], multiple: true }, |
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
4356630
109392