Secure your code as it's written. Use Snyk Code to scan source code in minutes - no build needed - and fix issues immediately.
},{"../util":17}],6:[function(require,module,exports){
var nodesFromList = require('graphlib').filter.nodesFromList,
/* jshint -W079 */
Set = require('cp-data').Set;
module.exports = initLayerGraphs;
/*
* This function takes a compound layered graph, g, and produces an array of
* layer graphs. Each entry in the array represents a subgraph of nodes
* relevant for performing crossing reduction on that layer.
*/
function initLayerGraphs(g) {
var ranks = [];
function dfs(u) {
if (u === null) {
g.children(u).forEach(function(v) { dfs(v); });
},{"../util":26}],15:[function(require,module,exports){
var nodesFromList = require('graphlib').filter.nodesFromList,
/* jshint -W079 */
Set = require('cp-data').Set;
module.exports = initLayerGraphs;
/*
* This function takes a compound layered graph, g, and produces an array of
* layer graphs. Each entry in the array represents a subgraph of nodes
* relevant for performing crossing reduction on that layer.
*/
function initLayerGraphs(g) {
var ranks = [];
function dfs(u) {
if (u === null) {
g.children(u).forEach(function(v) { dfs(v); });
},{"../util":26}],15:[function(require,module,exports){
var nodesFromList = require('graphlib').filter.nodesFromList,
/* jshint -W079 */
Set = require('cp-data').Set;
module.exports = initLayerGraphs;
/*
* This function takes a compound layered graph, g, and produces an array of
* layer graphs. Each entry in the array represents a subgraph of nodes
* relevant for performing crossing reduction on that layer.
*/
function initLayerGraphs(g) {
var ranks = [];
function dfs(u) {
if (u === null) {
g.children(u).forEach(function(v) { dfs(v); });
"use strict";
var nodesFromList = require("graphlib").filter.nodesFromList,
/* jshint -W079 */
Set = require("cp-data").Set;
module.exports = initLayerGraphs;
/*
* This function takes a compound layered graph, g, and produces an array of
* layer graphs. Each entry in the array represents a subgraph of nodes
* relevant for performing crossing reduction on that layer.
*/
function initLayerGraphs(g) {
var ranks = [];
function dfs(u) {
if (u === null) {
g.children(u).forEach(function(v) { dfs(v); });
},{"../util":17}],6:[function(require,module,exports){
var nodesFromList = require('graphlib').filter.nodesFromList,
/* jshint -W079 */
Set = require('cp-data').Set;
module.exports = initLayerGraphs;
/*
* This function takes a compound layered graph, g, and produces an array of
* layer graphs. Each entry in the array represents a subgraph of nodes
* relevant for performing crossing reduction on that layer.
*/
function initLayerGraphs(g) {
var ranks = [];
function dfs(u) {
if (u === null) {
g.children(u).forEach(function(v) { dfs(v); });
},{"./util":17}],10:[function(require,module,exports){
var util = require('./util'),
acyclic = require('./rank/acyclic'),
initRank = require('./rank/initRank'),
feasibleTree = require('./rank/feasibleTree'),
constraints = require('./rank/constraints'),
simplex = require('./rank/simplex'),
components = require('graphlib').alg.components,
filter = require('graphlib').filter;
exports.run = run;
exports.restoreEdges = restoreEdges;
/*
* Heuristic function that assigns a rank to each node of the input graph with
* the intent of minimizing edge lengths, while respecting the `minLen`
* attribute of incident edges.
*
* Prerequisites:
*
* * Each edge in the input graph must have an assigned 'minLen' attribute
*/
function run(g, useSimplex) {
expandSelfLoops(g);
},{"./util":17}],10:[function(require,module,exports){
var util = require('./util'),
acyclic = require('./rank/acyclic'),
initRank = require('./rank/initRank'),
feasibleTree = require('./rank/feasibleTree'),
constraints = require('./rank/constraints'),
simplex = require('./rank/simplex'),
components = require('graphlib').alg.components,
filter = require('graphlib').filter;
exports.run = run;
exports.restoreEdges = restoreEdges;
/*
* Heuristic function that assigns a rank to each node of the input graph with
* the intent of minimizing edge lengths, while respecting the `minLen`
* attribute of incident edges.
*
* Prerequisites:
*
* * Each edge in the input graph must have an assigned 'minLen' attribute
*/
function run(g, useSimplex) {
var selfLoops = removeSelfLoops(g);
},{"./util":26}],19:[function(require,module,exports){
var util = require('./util'),
acyclic = require('./rank/acyclic'),
initRank = require('./rank/initRank'),
feasibleTree = require('./rank/feasibleTree'),
constraints = require('./rank/constraints'),
simplex = require('./rank/simplex'),
components = require('graphlib').alg.components,
filter = require('graphlib').filter;
exports.run = run;
exports.restoreEdges = restoreEdges;
/*
* Heuristic function that assigns a rank to each node of the input graph with
* the intent of minimizing edge lengths, while respecting the `minLen`
* attribute of incident edges.
*
* Prerequisites:
*
* * Each edge in the input graph must have an assigned 'minLen' attribute
*/
function run(g, useSimplex) {
expandSelfLoops(g);
},{"./util":26}],19:[function(require,module,exports){
var util = require('./util'),
acyclic = require('./rank/acyclic'),
initRank = require('./rank/initRank'),
feasibleTree = require('./rank/feasibleTree'),
constraints = require('./rank/constraints'),
simplex = require('./rank/simplex'),
components = require('graphlib').alg.components,
filter = require('graphlib').filter;
exports.run = run;
exports.restoreEdges = restoreEdges;
/*
* Heuristic function that assigns a rank to each node of the input graph with
* the intent of minimizing edge lengths, while respecting the `minLen`
* attribute of incident edges.
*
* Prerequisites:
*
* * Each edge in the input graph must have an assigned 'minLen' attribute
*/
function run(g, useSimplex) {
expandSelfLoops(g);
},{"./util":18}],11:[function(require,module,exports){
'use strict';
var util = require('./util'),
acyclic = require('./rank/acyclic'),
initRank = require('./rank/initRank'),
feasibleTree = require('./rank/feasibleTree'),
constraints = require('./rank/constraints'),
simplex = require('./rank/simplex'),
components = require('graphlib').alg.components,
filter = require('graphlib').filter;
exports.run = run;
exports.restoreEdges = restoreEdges;
/*
* Heuristic function that assigns a rank to each node of the input graph with
* the intent of minimizing edge lengths, while respecting the `minLen`
* attribute of incident edges.
*
* Prerequisites:
*
* * Each edge in the input graph must have an assigned 'minLen' attribute
*/
function run(g, useSimplex) {
expandSelfLoops(g);