kitchen-simulator 5.0.0-test.1 → 5.0.0-test.12

package/es/utils/graph-cycles.js

@@ -1,239 +0,0 @@
-/**
- * UTILS
- */
-
-function sub(v1, v2) {
-  return [v1[0] - v2[0], v1[1] - v2[1]];
-}
-function mod(n, m) {
-  return (n % m + m) % m;
-}
-
-/**
- * CYCLES
- */
-
-function compute_ev_mapping(EV) {
-  var ev_mapping = EV.map(function (ev) {
-    return {
-      ev: ev,
-      color: 0,
-      direction: -1
-    };
-  });
-  return ev_mapping;
-}
-function compute_angle(P, V) {
-  var point = sub(V, P);
-  var angle = Math.atan2(point[1], point[0]);
-  return angle;
-}
-function compute_incidences(V, EV) {
-  var incidences = V.map(function (vertex, i) {
-    var incidence = [];
-    EV.forEach(function (edge, j) {
-      var endpoint;
-      var position;
-      if (edge[0] === i) {
-        endpoint = edge[1];
-        position = 1;
-      }
-      if (edge[1] === i) {
-        endpoint = edge[0];
-        position = 0;
-      }
-      endpoint !== undefined && incidence.push({
-        index: j,
-        endpoint: endpoint,
-        angle: compute_angle(vertex, V[endpoint]),
-        edge: edge,
-        position: position
-      });
-    });
-    incidence.sort(function (i1, i2) {
-      return i2.angle - i1.angle;
-    });
-    return incidence;
-  });
-  return incidences;
-}
-function get_starting_edge(incidences, ev_mapping) {
-  var e;
-  var position;
-  var direction;
-  for (e = 0; e < ev_mapping.length; e += 1) {
-    if (ev_mapping[e].color < 2) {
-      direction = -1 * ev_mapping[e].direction;
-      color(ev_mapping, e, direction);
-      return {
-        edge: e,
-        direction: direction,
-        position: direction === -1 ? 0 : 1
-      };
-    }
-  }
-}
-function get_next_edge(incidences, edge, position, EV) {
-  var items = incidences[EV[edge][position]];
-  //console.log(items, incidences, EV, edge, position);
-  var n_items = items.length;
-  var item;
-  var out;
-  var j;
-  for (j = 0; j < n_items; j += 1) {
-    item = items[j];
-    if (item.index === edge) {
-      out = items[mod(j + 1, items.length)];
-      return {
-        edge: out.index,
-        vertex: out.endpoint,
-        position: out.position,
-        direction: out.position ? 1 : -1
-      };
-    }
-  }
-}
-function color(ev_mapping, index, direction) {
-  ev_mapping[index].color += 1;
-  ev_mapping[index].direction = direction;
-}
-function find_cycles(V, EV) {
-  var ev_mapping = compute_ev_mapping(EV);
-  var incidences = compute_incidences(V, EV);
-  var V_cycles = [];
-  var E_cycles = [];
-  var dir_E_cycles = [];
-  var V_cycle;
-  var E_cycle;
-  var dir_E_cycle;
-  var next;
-  var counter = 0;
-  var start = get_starting_edge(incidences, ev_mapping);
-  while (start !== undefined) {
-    V_cycle = [EV[start.edge][mod(start.position + 1, 2)], EV[start.edge][start.position]];
-    E_cycle = [start.edge];
-    dir_E_cycle = [start.direction];
-    next = get_next_edge(incidences, start.edge, start.position, EV);
-    while (next.edge !== start.edge) {
-      V_cycle.push(next.vertex);
-      E_cycle.push(next.edge);
-      dir_E_cycle.push(next.direction);
-      color(ev_mapping, next.edge, next.direction);
-      next = get_next_edge(incidences, next.edge, next.position, EV);
-    }
-    E_cycles.push(E_cycle);
-    V_cycles.push(V_cycle);
-    dir_E_cycles.push(dir_E_cycle);
-
-    //console.log('############## CYCLE ', ++counter)
-    //console.log('EDGES:', E_cycle)
-    //console.log('VERTICES:', V_cycle)
-    //console.log('START', 'edge:', start.edge, 'position:', start.position)
-    //console.log('COUNTER:', ev_mapping.map(e => e.color), ev_mapping.map(e => e.color).reduce((a, b) => a + b));
-    //console.log('\n')
-
-    start = get_starting_edge(incidences, ev_mapping);
-  }
-  return {
-    v_cycles: V_cycles,
-    e_cycles: E_cycles,
-    dir_e_cycles: dir_E_cycles,
-    ev_mapping: ev_mapping
-  };
-}
-function find_short_cycles_indexes(v_cycles, e_cycles) {
-  var indexes = [];
-  var e_cycle;
-  var v_cycle;
-  var i;
-  for (i = 0; i < e_cycles.length; i += 1) {
-    e_cycle = e_cycles[i];
-    v_cycle = v_cycles[i];
-    if (e_cycle.length < 3 || v_cycle[0] !== v_cycle[v_cycle.length - 1]) {
-      indexes.push(i);
-    }
-  }
-  return indexes;
-}
-function find_inner_cycles(V, EV) {
-  var cycles = find_cycles(V, EV);
-  var v_cycles = cycles.v_cycles;
-  var e_cycles = cycles.e_cycles;
-  var short_cycles_indexes = find_short_cycles_indexes(v_cycles, e_cycles);
-  short_cycles_indexes.forEach(function (indx) {
-    v_cycles.splice(indx, 1);
-    e_cycles.splice(indx, 1);
-  });
-  var dir_e_cycles = cycles.dir_e_cycles;
-  var rooms_values = cycles.e_cycles.map(function (cycle, i) {
-    return cycle.map(function (edge, j) {
-      var v1;
-      var v2;
-      var dir = dir_e_cycles[i][j] > 0;
-      if (dir > 0) {
-        v1 = EV[edge][0];
-        v2 = EV[edge][1];
-      } else {
-        v1 = EV[edge][1];
-        v2 = EV[edge][0];
-      }
-      return (V[v2][0] - V[v1][0]) * (V[v2][1] + V[v1][1]);
-    });
-  });
-  var rooms_sums = rooms_values.map(function (room) {
-    return room.reduce(function (a, b) {
-      return a + b;
-    });
-  });
-  var positive_count = rooms_sums.filter(function (sum) {
-    return sum > 0;
-  }).length;
-  var negative_count = rooms_sums.length - positive_count;
-  var rm_neg = positive_count >= negative_count ? 1 : -1;
-  return {
-    v_cycles: cycles.v_cycles.filter(function (v, i) {
-      return rm_neg * rooms_sums[i] > 0;
-    }),
-    e_cycles: cycles.e_cycles.filter(function (v, i) {
-      return rm_neg * rooms_sums[i] > 0;
-    }),
-    ev_mapping: cycles.ev_mapping
-  };
-}
-
-// export default find_inner_cycles;
-module.exports = find_inner_cycles;
-
-/**
- * DATA
- */
-
-// let V = [[0.5774, 1.0], [1.0, 1.0], [1.1547, 0.0], [1.0, 0.0], [0.0, 0.0], [0.0, 0.732], [1.0, 0.1547], [0.732, 0.0], [1.0491, 0.183], [-0.317, 0.549], [1.0, 0.268], [0.183, -0.3169], [0.5491, 1.049], [0.4642, 1.0], [0.0, -0.4226], [0.0, 1.0]]
-// let EV = [[0, 1], [2, 3], [5, 4], [7, 6], [2, 8], [3, 6], [4, 9], [0, 10], [9, 5], [8, 10], [7, 11], [12, 13], [6, 8], [6, 10], [4, 7], [4, 11], [4, 14], [5, 15], [11, 14], [0, 12], [13, 15], [0, 13], [1, 10], [3, 7], [5, 13]]
-
-// let V = [[0,0],[10,0],[10,10],[0,10], [100,100],[110,100],[110,110],[100,110], [5,0], [5,10]]
-// let V = [[0,0.5],[12,-0.7],[14,14],[-2,10], [103,106],[117,98],[96,112],[104,109], [5.5,0.8], [4.8,10.5]]
-// let EV = [[3,9],[9,2],[2,1],[1,8],[8,0],[0,3],[8,9]] // IT WORKS
-// let EV = [[3,9],[9,2],[2,1],[1,8],[8,0],[0,3],[8,9], [5,6], [6,7], [2,5]] // IT DOESN'T WORK
-// let EV = [[3,2],[2,1],[1,0],[0,3]] // IT WORKS
-// let EV = [[2,3],[1,2],[0,1],[3,0]] // IT WORKS
-// let EV = [[2,3],[1,2],[0,1],[3,0],[6,7],[5,6],[4,5],[7,4]] // IT WORKS
-// let EV = [[3,2],[2,1],[1,0],[0,3],[7,6],[6,5],[5,4],[4,7]] // IT WORKS
-
-// let V = [[2,5],[5,6],[10,6.8],[23,8],[9.6,11.3],[20,15],[25,16],[29,18],[30,22],[4,11],[6,10],[24,25],[18,20],[27,7]]
-// let EV = [[0,1],[10,0],[9,10],[9,1],[1,2],[4,2],[3,13],[2,3],[4,5],[5,6],[6,7],[12,5],[12,11],[11,6],[11,8],[7,8],[9,4]]
-
-/**
- * MAIN
- */
-
-// let cycles_data = find_inner_cycles(V, EV)
-// console.log('############## OUTPUT')
-// console.log('EDGES:')
-// console.log(cycles_data.e_cycles)
-// console.log('\n')
-// console.log('VERTICES:')
-// console.log(cycles_data.v_cycles)
-// console.log('\n')
-// console.log(cycles_data.ev_mapping.every(m => m.color === 2))
-//# sourceMappingURL=graph-cycles.js.map

package/es/utils/graph-cycles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-cycles.js","names":["sub","v1","v2","mod","n","m","compute_ev_mapping","EV","ev_mapping","map","ev","color","direction","compute_angle","P","V","point","angle","Math","atan2","compute_incidences","incidences","vertex","i","incidence","forEach","edge","j","endpoint","position","undefined","push","index","sort","i1","i2","get_starting_edge","e","length","get_next_edge","items","n_items","item","out","find_cycles","V_cycles","E_cycles","dir_E_cycles","V_cycle","E_cycle","dir_E_cycle","next","counter","start","v_cycles","e_cycles","dir_e_cycles","find_short_cycles_indexes","indexes","e_cycle","v_cycle","find_inner_cycles","cycles","short_cycles_indexes","indx","splice","rooms_values","cycle","dir","rooms_sums","room","reduce","a","b","positive_count","filter","sum","negative_count","rm_neg","v","module","exports"],"sources":["../../src/utils/graph-cycles.js"],"sourcesContent":["/**\r\n * UTILS\r\n */\r\n\r\nfunction sub(v1, v2) {\r\n  return [v1[0] - v2[0], v1[1] - v2[1]];\r\n}\r\n\r\nfunction mod(n, m) {\r\n  return ((n % m) + m) % m;\r\n}\r\n\r\n/**\r\n * CYCLES\r\n */\r\n\r\nfunction compute_ev_mapping(EV) {\r\n  let ev_mapping = EV.map(function (ev) {\r\n    return {\r\n      ev: ev,\r\n      color: 0,\r\n      direction: -1\r\n    };\r\n  });\r\n\r\n  return ev_mapping;\r\n}\r\n\r\nfunction compute_angle(P, V) {\r\n  let point = sub(V, P);\r\n  let angle = Math.atan2(point[1], point[0]);\r\n  return angle;\r\n}\r\n\r\nfunction compute_incidences(V, EV) {\r\n  let incidences = V.map(function (vertex, i) {\r\n    let incidence = [];\r\n    EV.forEach(function (edge, j) {\r\n      let endpoint;\r\n      let position;\r\n\r\n      if (edge[0] === i) {\r\n        endpoint = edge[1];\r\n        position = 1;\r\n      }\r\n\r\n      if (edge[1] === i) {\r\n        endpoint = edge[0];\r\n        position = 0;\r\n      }\r\n\r\n      endpoint !== undefined &&\r\n        incidence.push({\r\n          index: j,\r\n          endpoint: endpoint,\r\n          angle: compute_angle(vertex, V[endpoint]),\r\n          edge: edge,\r\n          position: position\r\n        });\r\n    });\r\n\r\n    incidence.sort(function (i1, i2) {\r\n      return i2.angle - i1.angle;\r\n    });\r\n\r\n    return incidence;\r\n  });\r\n\r\n  return incidences;\r\n}\r\n\r\nfunction get_starting_edge(incidences, ev_mapping) {\r\n  let e;\r\n  let position;\r\n  let direction;\r\n  for (e = 0; e < ev_mapping.length; e += 1) {\r\n    if (ev_mapping[e].color < 2) {\r\n      direction = -1 * ev_mapping[e].direction;\r\n      color(ev_mapping, e, direction);\r\n      return {\r\n        edge: e,\r\n        direction: direction,\r\n        position: direction === -1 ? 0 : 1\r\n      };\r\n    }\r\n  }\r\n}\r\n\r\nfunction get_next_edge(incidences, edge, position, EV) {\r\n  let items = incidences[EV[edge][position]];\r\n  //console.log(items, incidences, EV, edge, position);\r\n  let n_items = items.length;\r\n  let item;\r\n  let out;\r\n  let j;\r\n  for (j = 0; j < n_items; j += 1) {\r\n    item = items[j];\r\n    if (item.index === edge) {\r\n      out = items[mod(j + 1, items.length)];\r\n      return {\r\n        edge: out.index,\r\n        vertex: out.endpoint,\r\n        position: out.position,\r\n        direction: out.position ? 1 : -1\r\n      };\r\n    }\r\n  }\r\n}\r\n\r\nfunction color(ev_mapping, index, direction) {\r\n  ev_mapping[index].color += 1;\r\n  ev_mapping[index].direction = direction;\r\n}\r\n\r\nfunction find_cycles(V, EV) {\r\n  let ev_mapping = compute_ev_mapping(EV);\r\n  let incidences = compute_incidences(V, EV);\r\n  let V_cycles = [];\r\n  let E_cycles = [];\r\n  let dir_E_cycles = [];\r\n  let V_cycle;\r\n  let E_cycle;\r\n  let dir_E_cycle;\r\n  let next;\r\n  let counter = 0;\r\n  let start = get_starting_edge(incidences, ev_mapping);\r\n\r\n  while (start !== undefined) {\r\n    V_cycle = [\r\n      EV[start.edge][mod(start.position + 1, 2)],\r\n      EV[start.edge][start.position]\r\n    ];\r\n    E_cycle = [start.edge];\r\n    dir_E_cycle = [start.direction];\r\n    next = get_next_edge(incidences, start.edge, start.position, EV);\r\n    while (next.edge !== start.edge) {\r\n      V_cycle.push(next.vertex);\r\n      E_cycle.push(next.edge);\r\n      dir_E_cycle.push(next.direction);\r\n      color(ev_mapping, next.edge, next.direction);\r\n      next = get_next_edge(incidences, next.edge, next.position, EV);\r\n    }\r\n    E_cycles.push(E_cycle);\r\n    V_cycles.push(V_cycle);\r\n    dir_E_cycles.push(dir_E_cycle);\r\n\r\n    //console.log('############## CYCLE ', ++counter)\r\n    //console.log('EDGES:', E_cycle)\r\n    //console.log('VERTICES:', V_cycle)\r\n    //console.log('START', 'edge:', start.edge, 'position:', start.position)\r\n    //console.log('COUNTER:', ev_mapping.map(e => e.color), ev_mapping.map(e => e.color).reduce((a, b) => a + b));\r\n    //console.log('\\n')\r\n\r\n    start = get_starting_edge(incidences, ev_mapping);\r\n  }\r\n\r\n  return {\r\n    v_cycles: V_cycles,\r\n    e_cycles: E_cycles,\r\n    dir_e_cycles: dir_E_cycles,\r\n    ev_mapping: ev_mapping\r\n  };\r\n}\r\n\r\nfunction find_short_cycles_indexes(v_cycles, e_cycles) {\r\n  let indexes = [];\r\n  let e_cycle;\r\n  let v_cycle;\r\n  let i;\r\n\r\n  for (i = 0; i < e_cycles.length; i += 1) {\r\n    e_cycle = e_cycles[i];\r\n    v_cycle = v_cycles[i];\r\n    if (e_cycle.length < 3 || v_cycle[0] !== v_cycle[v_cycle.length - 1]) {\r\n      indexes.push(i);\r\n    }\r\n  }\r\n\r\n  return indexes;\r\n}\r\n\r\nfunction find_inner_cycles(V, EV) {\r\n  let cycles = find_cycles(V, EV);\r\n  let v_cycles = cycles.v_cycles;\r\n  let e_cycles = cycles.e_cycles;\r\n  let short_cycles_indexes = find_short_cycles_indexes(v_cycles, e_cycles);\r\n  short_cycles_indexes.forEach(indx => {\r\n    v_cycles.splice(indx, 1);\r\n    e_cycles.splice(indx, 1);\r\n  });\r\n  let dir_e_cycles = cycles.dir_e_cycles;\r\n  let rooms_values = cycles.e_cycles.map((cycle, i) =>\r\n    cycle.map(function (edge, j) {\r\n      let v1;\r\n      let v2;\r\n\r\n      let dir = dir_e_cycles[i][j] > 0;\r\n\r\n      if (dir > 0) {\r\n        v1 = EV[edge][0];\r\n        v2 = EV[edge][1];\r\n      } else {\r\n        v1 = EV[edge][1];\r\n        v2 = EV[edge][0];\r\n      }\r\n\r\n      return (V[v2][0] - V[v1][0]) * (V[v2][1] + V[v1][1]);\r\n    })\r\n  );\r\n\r\n  let rooms_sums = rooms_values.map(room => room.reduce((a, b) => a + b));\r\n\r\n  let positive_count = rooms_sums.filter(sum => sum > 0).length;\r\n  let negative_count = rooms_sums.length - positive_count;\r\n\r\n  let rm_neg = positive_count >= negative_count ? 1 : -1;\r\n\r\n  return {\r\n    v_cycles: cycles.v_cycles.filter((v, i) => rm_neg * rooms_sums[i] > 0),\r\n    e_cycles: cycles.e_cycles.filter((v, i) => rm_neg * rooms_sums[i] > 0),\r\n    ev_mapping: cycles.ev_mapping\r\n  };\r\n}\r\n\r\n// export default find_inner_cycles;\r\nmodule.exports = find_inner_cycles;\r\n\r\n/**\r\n * DATA\r\n */\r\n\r\n// let V = [[0.5774, 1.0], [1.0, 1.0], [1.1547, 0.0], [1.0, 0.0], [0.0, 0.0], [0.0, 0.732], [1.0, 0.1547], [0.732, 0.0], [1.0491, 0.183], [-0.317, 0.549], [1.0, 0.268], [0.183, -0.3169], [0.5491, 1.049], [0.4642, 1.0], [0.0, -0.4226], [0.0, 1.0]]\r\n// let EV = [[0, 1], [2, 3], [5, 4], [7, 6], [2, 8], [3, 6], [4, 9], [0, 10], [9, 5], [8, 10], [7, 11], [12, 13], [6, 8], [6, 10], [4, 7], [4, 11], [4, 14], [5, 15], [11, 14], [0, 12], [13, 15], [0, 13], [1, 10], [3, 7], [5, 13]]\r\n\r\n// let V = [[0,0],[10,0],[10,10],[0,10], [100,100],[110,100],[110,110],[100,110], [5,0], [5,10]]\r\n// let V = [[0,0.5],[12,-0.7],[14,14],[-2,10], [103,106],[117,98],[96,112],[104,109], [5.5,0.8], [4.8,10.5]]\r\n// let EV = [[3,9],[9,2],[2,1],[1,8],[8,0],[0,3],[8,9]] // IT WORKS\r\n// let EV = [[3,9],[9,2],[2,1],[1,8],[8,0],[0,3],[8,9], [5,6], [6,7], [2,5]] // IT DOESN'T WORK\r\n// let EV = [[3,2],[2,1],[1,0],[0,3]] // IT WORKS\r\n// let EV = [[2,3],[1,2],[0,1],[3,0]] // IT WORKS\r\n// let EV = [[2,3],[1,2],[0,1],[3,0],[6,7],[5,6],[4,5],[7,4]] // IT WORKS\r\n// let EV = [[3,2],[2,1],[1,0],[0,3],[7,6],[6,5],[5,4],[4,7]] // IT WORKS\r\n\r\n// let V = [[2,5],[5,6],[10,6.8],[23,8],[9.6,11.3],[20,15],[25,16],[29,18],[30,22],[4,11],[6,10],[24,25],[18,20],[27,7]]\r\n// let EV = [[0,1],[10,0],[9,10],[9,1],[1,2],[4,2],[3,13],[2,3],[4,5],[5,6],[6,7],[12,5],[12,11],[11,6],[11,8],[7,8],[9,4]]\r\n\r\n/**\r\n * MAIN\r\n */\r\n\r\n// let cycles_data = find_inner_cycles(V, EV)\r\n// console.log('############## OUTPUT')\r\n// console.log('EDGES:')\r\n// console.log(cycles_data.e_cycles)\r\n// console.log('\\n')\r\n// console.log('VERTICES:')\r\n// console.log(cycles_data.v_cycles)\r\n// console.log('\\n')\r\n// console.log(cycles_data.ev_mapping.every(m => m.color === 2))\r\n"],"mappings":"AAAA;AACA;AACA;;AAEA,SAASA,GAAGA,CAACC,EAAE,EAAEC,EAAE,EAAE;EACnB,OAAO,CAACD,EAAE,CAAC,CAAC,CAAC,GAAGC,EAAE,CAAC,CAAC,CAAC,EAAED,EAAE,CAAC,CAAC,CAAC,GAAGC,EAAE,CAAC,CAAC,CAAC,CAAC;AACvC;AAEA,SAASC,GAAGA,CAACC,CAAC,EAAEC,CAAC,EAAE;EACjB,OAAO,CAAED,CAAC,GAAGC,CAAC,GAAIA,CAAC,IAAIA,CAAC;AAC1B;;AAEA;AACA;AACA;;AAEA,SAASC,kBAAkBA,CAACC,EAAE,EAAE;EAC9B,IAAIC,UAAU,GAAGD,EAAE,CAACE,GAAG,CAAC,UAAUC,EAAE,EAAE;IACpC,OAAO;MACLA,EAAE,EAAEA,EAAE;MACNC,KAAK,EAAE,CAAC;MACRC,SAAS,EAAE,CAAC;IACd,CAAC;EACH,CAAC,CAAC;EAEF,OAAOJ,UAAU;AACnB;AAEA,SAASK,aAAaA,CAACC,CAAC,EAAEC,CAAC,EAAE;EAC3B,IAAIC,KAAK,GAAGhB,GAAG,CAACe,CAAC,EAAED,CAAC,CAAC;EACrB,IAAIG,KAAK,GAAGC,IAAI,CAACC,KAAK,CAACH,KAAK,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,CAAC,CAAC,CAAC;EAC1C,OAAOC,KAAK;AACd;AAEA,SAASG,kBAAkBA,CAACL,CAAC,EAAER,EAAE,EAAE;EACjC,IAAIc,UAAU,GAAGN,CAAC,CAACN,GAAG,CAAC,UAAUa,MAAM,EAAEC,CAAC,EAAE;IAC1C,IAAIC,SAAS,GAAG,EAAE;IAClBjB,EAAE,CAACkB,OAAO,CAAC,UAAUC,IAAI,EAAEC,CAAC,EAAE;MAC5B,IAAIC,QAAQ;MACZ,IAAIC,QAAQ;MAEZ,IAAIH,IAAI,CAAC,CAAC,CAAC,KAAKH,CAAC,EAAE;QACjBK,QAAQ,GAAGF,IAAI,CAAC,CAAC,CAAC;QAClBG,QAAQ,GAAG,CAAC;MACd;MAEA,IAAIH,IAAI,CAAC,CAAC,CAAC,KAAKH,CAAC,EAAE;QACjBK,QAAQ,GAAGF,IAAI,CAAC,CAAC,CAAC;QAClBG,QAAQ,GAAG,CAAC;MACd;MAEAD,QAAQ,KAAKE,SAAS,IACpBN,SAAS,CAACO,IAAI,CAAC;QACbC,KAAK,EAAEL,CAAC;QACRC,QAAQ,EAAEA,QAAQ;QAClBX,KAAK,EAAEJ,aAAa,CAACS,MAAM,EAAEP,CAAC,CAACa,QAAQ,CAAC,CAAC;QACzCF,IAAI,EAAEA,IAAI;QACVG,QAAQ,EAAEA;MACZ,CAAC,CAAC;IACN,CAAC,CAAC;IAEFL,SAAS,CAACS,IAAI,CAAC,UAAUC,EAAE,EAAEC,EAAE,EAAE;MAC/B,OAAOA,EAAE,CAAClB,KAAK,GAAGiB,EAAE,CAACjB,KAAK;IAC5B,CAAC,CAAC;IAEF,OAAOO,SAAS;EAClB,CAAC,CAAC;EAEF,OAAOH,UAAU;AACnB;AAEA,SAASe,iBAAiBA,CAACf,UAAU,EAAEb,UAAU,EAAE;EACjD,IAAI6B,CAAC;EACL,IAAIR,QAAQ;EACZ,IAAIjB,SAAS;EACb,KAAKyB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG7B,UAAU,CAAC8B,MAAM,EAAED,CAAC,IAAI,CAAC,EAAE;IACzC,IAAI7B,UAAU,CAAC6B,CAAC,CAAC,CAAC1B,KAAK,GAAG,CAAC,EAAE;MAC3BC,SAAS,GAAG,CAAC,CAAC,GAAGJ,UAAU,CAAC6B,CAAC,CAAC,CAACzB,SAAS;MACxCD,KAAK,CAACH,UAAU,EAAE6B,CAAC,EAAEzB,SAAS,CAAC;MAC/B,OAAO;QACLc,IAAI,EAAEW,CAAC;QACPzB,SAAS,EAAEA,SAAS;QACpBiB,QAAQ,EAAEjB,SAAS,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG;MACnC,CAAC;IACH;EACF;AACF;AAEA,SAAS2B,aAAaA,CAAClB,UAAU,EAAEK,IAAI,EAAEG,QAAQ,EAAEtB,EAAE,EAAE;EACrD,IAAIiC,KAAK,GAAGnB,UAAU,CAACd,EAAE,CAACmB,IAAI,CAAC,CAACG,QAAQ,CAAC,CAAC;EAC1C;EACA,IAAIY,OAAO,GAAGD,KAAK,CAACF,MAAM;EAC1B,IAAII,IAAI;EACR,IAAIC,GAAG;EACP,IAAIhB,CAAC;EACL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGc,OAAO,EAAEd,CAAC,IAAI,CAAC,EAAE;IAC/Be,IAAI,GAAGF,KAAK,CAACb,CAAC,CAAC;IACf,IAAIe,IAAI,CAACV,KAAK,KAAKN,IAAI,EAAE;MACvBiB,GAAG,GAAGH,KAAK,CAACrC,GAAG,CAACwB,CAAC,GAAG,CAAC,EAAEa,KAAK,CAACF,MAAM,CAAC,CAAC;MACrC,OAAO;QACLZ,IAAI,EAAEiB,GAAG,CAACX,KAAK;QACfV,MAAM,EAAEqB,GAAG,CAACf,QAAQ;QACpBC,QAAQ,EAAEc,GAAG,CAACd,QAAQ;QACtBjB,SAAS,EAAE+B,GAAG,CAACd,QAAQ,GAAG,CAAC,GAAG,CAAC;MACjC,CAAC;IACH;EACF;AACF;AAEA,SAASlB,KAAKA,CAACH,UAAU,EAAEwB,KAAK,EAAEpB,SAAS,EAAE;EAC3CJ,UAAU,CAACwB,KAAK,CAAC,CAACrB,KAAK,IAAI,CAAC;EAC5BH,UAAU,CAACwB,KAAK,CAAC,CAACpB,SAAS,GAAGA,SAAS;AACzC;AAEA,SAASgC,WAAWA,CAAC7B,CAAC,EAAER,EAAE,EAAE;EAC1B,IAAIC,UAAU,GAAGF,kBAAkB,CAACC,EAAE,CAAC;EACvC,IAAIc,UAAU,GAAGD,kBAAkB,CAACL,CAAC,EAAER,EAAE,CAAC;EAC1C,IAAIsC,QAAQ,GAAG,EAAE;EACjB,IAAIC,QAAQ,GAAG,EAAE;EACjB,IAAIC,YAAY,GAAG,EAAE;EACrB,IAAIC,OAAO;EACX,IAAIC,OAAO;EACX,IAAIC,WAAW;EACf,IAAIC,IAAI;EACR,IAAIC,OAAO,GAAG,CAAC;EACf,IAAIC,KAAK,GAAGjB,iBAAiB,CAACf,UAAU,EAAEb,UAAU,CAAC;EAErD,OAAO6C,KAAK,KAAKvB,SAAS,EAAE;IAC1BkB,OAAO,GAAG,CACRzC,EAAE,CAAC8C,KAAK,CAAC3B,IAAI,CAAC,CAACvB,GAAG,CAACkD,KAAK,CAACxB,QAAQ,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAC1CtB,EAAE,CAAC8C,KAAK,CAAC3B,IAAI,CAAC,CAAC2B,KAAK,CAACxB,QAAQ,CAAC,CAC/B;IACDoB,OAAO,GAAG,CAACI,KAAK,CAAC3B,IAAI,CAAC;IACtBwB,WAAW,GAAG,CAACG,KAAK,CAACzC,SAAS,CAAC;IAC/BuC,IAAI,GAAGZ,aAAa,CAAClB,UAAU,EAAEgC,KAAK,CAAC3B,IAAI,EAAE2B,KAAK,CAACxB,QAAQ,EAAEtB,EAAE,CAAC;IAChE,OAAO4C,IAAI,CAACzB,IAAI,KAAK2B,KAAK,CAAC3B,IAAI,EAAE;MAC/BsB,OAAO,CAACjB,IAAI,CAACoB,IAAI,CAAC7B,MAAM,CAAC;MACzB2B,OAAO,CAAClB,IAAI,CAACoB,IAAI,CAACzB,IAAI,CAAC;MACvBwB,WAAW,CAACnB,IAAI,CAACoB,IAAI,CAACvC,SAAS,CAAC;MAChCD,KAAK,CAACH,UAAU,EAAE2C,IAAI,CAACzB,IAAI,EAAEyB,IAAI,CAACvC,SAAS,CAAC;MAC5CuC,IAAI,GAAGZ,aAAa,CAAClB,UAAU,EAAE8B,IAAI,CAACzB,IAAI,EAAEyB,IAAI,CAACtB,QAAQ,EAAEtB,EAAE,CAAC;IAChE;IACAuC,QAAQ,CAACf,IAAI,CAACkB,OAAO,CAAC;IACtBJ,QAAQ,CAACd,IAAI,CAACiB,OAAO,CAAC;IACtBD,YAAY,CAAChB,IAAI,CAACmB,WAAW,CAAC;;IAE9B;IACA;IACA;IACA;IACA;IACA;;IAEAG,KAAK,GAAGjB,iBAAiB,CAACf,UAAU,EAAEb,UAAU,CAAC;EACnD;EAEA,OAAO;IACL8C,QAAQ,EAAET,QAAQ;IAClBU,QAAQ,EAAET,QAAQ;IAClBU,YAAY,EAAET,YAAY;IAC1BvC,UAAU,EAAEA;EACd,CAAC;AACH;AAEA,SAASiD,yBAAyBA,CAACH,QAAQ,EAAEC,QAAQ,EAAE;EACrD,IAAIG,OAAO,GAAG,EAAE;EAChB,IAAIC,OAAO;EACX,IAAIC,OAAO;EACX,IAAIrC,CAAC;EAEL,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgC,QAAQ,CAACjB,MAAM,EAAEf,CAAC,IAAI,CAAC,EAAE;IACvCoC,OAAO,GAAGJ,QAAQ,CAAChC,CAAC,CAAC;IACrBqC,OAAO,GAAGN,QAAQ,CAAC/B,CAAC,CAAC;IACrB,IAAIoC,OAAO,CAACrB,MAAM,GAAG,CAAC,IAAIsB,OAAO,CAAC,CAAC,CAAC,KAAKA,OAAO,CAACA,OAAO,CAACtB,MAAM,GAAG,CAAC,CAAC,EAAE;MACpEoB,OAAO,CAAC3B,IAAI,CAACR,CAAC,CAAC;IACjB;EACF;EAEA,OAAOmC,OAAO;AAChB;AAEA,SAASG,iBAAiBA,CAAC9C,CAAC,EAAER,EAAE,EAAE;EAChC,IAAIuD,MAAM,GAAGlB,WAAW,CAAC7B,CAAC,EAAER,EAAE,CAAC;EAC/B,IAAI+C,QAAQ,GAAGQ,MAAM,CAACR,QAAQ;EAC9B,IAAIC,QAAQ,GAAGO,MAAM,CAACP,QAAQ;EAC9B,IAAIQ,oBAAoB,GAAGN,yBAAyB,CAACH,QAAQ,EAAEC,QAAQ,CAAC;EACxEQ,oBAAoB,CAACtC,OAAO,CAAC,UAAAuC,IAAI,EAAI;IACnCV,QAAQ,CAACW,MAAM,CAACD,IAAI,EAAE,CAAC,CAAC;IACxBT,QAAQ,CAACU,MAAM,CAACD,IAAI,EAAE,CAAC,CAAC;EAC1B,CAAC,CAAC;EACF,IAAIR,YAAY,GAAGM,MAAM,CAACN,YAAY;EACtC,IAAIU,YAAY,GAAGJ,MAAM,CAACP,QAAQ,CAAC9C,GAAG,CAAC,UAAC0D,KAAK,EAAE5C,CAAC;IAAA,OAC9C4C,KAAK,CAAC1D,GAAG,CAAC,UAAUiB,IAAI,EAAEC,CAAC,EAAE;MAC3B,IAAI1B,EAAE;MACN,IAAIC,EAAE;MAEN,IAAIkE,GAAG,GAAGZ,YAAY,CAACjC,CAAC,CAAC,CAACI,CAAC,CAAC,GAAG,CAAC;MAEhC,IAAIyC,GAAG,GAAG,CAAC,EAAE;QACXnE,EAAE,GAAGM,EAAE,CAACmB,IAAI,CAAC,CAAC,CAAC,CAAC;QAChBxB,EAAE,GAAGK,EAAE,CAACmB,IAAI,CAAC,CAAC,CAAC,CAAC;MAClB,CAAC,MAAM;QACLzB,EAAE,GAAGM,EAAE,CAACmB,IAAI,CAAC,CAAC,CAAC,CAAC;QAChBxB,EAAE,GAAGK,EAAE,CAACmB,IAAI,CAAC,CAAC,CAAC,CAAC;MAClB;MAEA,OAAO,CAACX,CAAC,CAACb,EAAE,CAAC,CAAC,CAAC,CAAC,GAAGa,CAAC,CAACd,EAAE,CAAC,CAAC,CAAC,CAAC,KAAKc,CAAC,CAACb,EAAE,CAAC,CAAC,CAAC,CAAC,GAAGa,CAAC,CAACd,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC;EAAA,CACJ,CAAC;EAED,IAAIoE,UAAU,GAAGH,YAAY,CAACzD,GAAG,CAAC,UAAA6D,IAAI;IAAA,OAAIA,IAAI,CAACC,MAAM,CAAC,UAACC,CAAC,EAAEC,CAAC;MAAA,OAAKD,CAAC,GAAGC,CAAC;IAAA,EAAC;EAAA,EAAC;EAEvE,IAAIC,cAAc,GAAGL,UAAU,CAACM,MAAM,CAAC,UAAAC,GAAG;IAAA,OAAIA,GAAG,GAAG,CAAC;EAAA,EAAC,CAACtC,MAAM;EAC7D,IAAIuC,cAAc,GAAGR,UAAU,CAAC/B,MAAM,GAAGoC,cAAc;EAEvD,IAAII,MAAM,GAAGJ,cAAc,IAAIG,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC;EAEtD,OAAO;IACLvB,QAAQ,EAAEQ,MAAM,CAACR,QAAQ,CAACqB,MAAM,CAAC,UAACI,CAAC,EAAExD,CAAC;MAAA,OAAKuD,MAAM,GAAGT,UAAU,CAAC9C,CAAC,CAAC,GAAG,CAAC;IAAA,EAAC;IACtEgC,QAAQ,EAAEO,MAAM,CAACP,QAAQ,CAACoB,MAAM,CAAC,UAACI,CAAC,EAAExD,CAAC;MAAA,OAAKuD,MAAM,GAAGT,UAAU,CAAC9C,CAAC,CAAC,GAAG,CAAC;IAAA,EAAC;IACtEf,UAAU,EAAEsD,MAAM,CAACtD;EACrB,CAAC;AACH;;AAEA;AACAwE,MAAM,CAACC,OAAO,GAAGpB,iBAAiB;;AAElC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","ignoreList":[]}

package/es/utils/graph-inner-cycles.js

@@ -1,47 +0,0 @@
-import Graph from './graph';
-import getEdgesOfSubgraphs from './get-edges-of-subgraphs';
-import graphCycles from './graph-cycles';
-import { List } from 'immutable';
-export function calculateInnerCycles(verticesArray, edgesArray) {
-  var innerCycles = new List();
-  var graph = new Graph(verticesArray.length);
-  edgesArray.forEach(function (line) {
-    graph.addEdge(line[0], line[1]);
-    graph.addEdge(line[1], line[0]);
-  });
-  graph.BCC();
-  var subgraphs = graph.subgraphs.filter(function (subgraph) {
-    return subgraph.length >= 3;
-  });
-  var edgesOfSubgraphsArray = getEdgesOfSubgraphs(subgraphs, graph);
-  var edges = [];
-  edgesOfSubgraphsArray.forEach(function (es) {
-    es.forEach(function (edge) {
-      return edges.push(edge);
-    });
-  });
-  var cycles = graphCycles(verticesArray, edges);
-  cycles.v_cycles.forEach(function (cycle) {
-    cycle.shift();
-    innerCycles = innerCycles.push(cycle);
-  });
-  return innerCycles;
-}
-export function isClockWiseOrder(innerCycleWithCoords) {
-  // See: https://stackoverflow.com/a/1165943 and http://blog.element84.com/polygon-winding.html
-
-  var i = 0;
-  var twiceEnclosedArea = 0;
-  var size = innerCycleWithCoords.size;
-  for (i = 0; i < size; i++) {
-    var _innerCycleWithCoords = innerCycleWithCoords.get(i),
-      x1 = _innerCycleWithCoords.x,
-      y1 = _innerCycleWithCoords.y;
-    var _innerCycleWithCoords2 = innerCycleWithCoords.get((i + 1) % size),
-      x2 = _innerCycleWithCoords2.x,
-      y2 = _innerCycleWithCoords2.y;
-    twiceEnclosedArea += (x2 - x1) * (y2 + y1);
-  }
-  return twiceEnclosedArea > 0;
-}
-//# sourceMappingURL=graph-inner-cycles.js.map

package/es/utils/graph-inner-cycles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-inner-cycles.js","names":["Graph","getEdgesOfSubgraphs","graphCycles","List","calculateInnerCycles","verticesArray","edgesArray","innerCycles","graph","length","forEach","line","addEdge","BCC","subgraphs","filter","subgraph","edgesOfSubgraphsArray","edges","es","edge","push","cycles","v_cycles","cycle","shift","isClockWiseOrder","innerCycleWithCoords","i","twiceEnclosedArea","size","_innerCycleWithCoords","get","x1","x","y1","y","_innerCycleWithCoords2","x2","y2"],"sources":["../../src/utils/graph-inner-cycles.js"],"sourcesContent":["import Graph from './graph';\r\nimport getEdgesOfSubgraphs from './get-edges-of-subgraphs';\r\nimport graphCycles from './graph-cycles';\r\nimport { List } from 'immutable';\r\n\r\nexport function calculateInnerCycles(verticesArray, edgesArray) {\r\n  let innerCycles = new List();\r\n\r\n  let graph = new Graph(verticesArray.length);\r\n  edgesArray.forEach(line => {\r\n    graph.addEdge(line[0], line[1]);\r\n    graph.addEdge(line[1], line[0]);\r\n  });\r\n\r\n  graph.BCC();\r\n\r\n  let subgraphs = graph.subgraphs.filter(subgraph => subgraph.length >= 3);\r\n  let edgesOfSubgraphsArray = getEdgesOfSubgraphs(subgraphs, graph);\r\n\r\n  let edges = [];\r\n  edgesOfSubgraphsArray.forEach(es => {\r\n    es.forEach(edge => edges.push(edge));\r\n  });\r\n\r\n  let cycles = graphCycles(verticesArray, edges);\r\n  cycles.v_cycles.forEach(cycle => {\r\n    cycle.shift();\r\n    innerCycles = innerCycles.push(cycle);\r\n  });\r\n\r\n  return innerCycles;\r\n}\r\n\r\nexport function isClockWiseOrder(innerCycleWithCoords) {\r\n  // See: https://stackoverflow.com/a/1165943 and http://blog.element84.com/polygon-winding.html\r\n\r\n  let i = 0;\r\n  let twiceEnclosedArea = 0;\r\n  let size = innerCycleWithCoords.size;\r\n\r\n  for (i = 0; i < size; i++) {\r\n    let { x: x1, y: y1 } = innerCycleWithCoords.get(i);\r\n    let { x: x2, y: y2 } = innerCycleWithCoords.get((i + 1) % size);\r\n\r\n    twiceEnclosedArea += (x2 - x1) * (y2 + y1);\r\n  }\r\n\r\n  return twiceEnclosedArea > 0;\r\n}\r\n"],"mappings":"AAAA,OAAOA,KAAK,MAAM,SAAS;AAC3B,OAAOC,mBAAmB,MAAM,0BAA0B;AAC1D,OAAOC,WAAW,MAAM,gBAAgB;AACxC,SAASC,IAAI,QAAQ,WAAW;AAEhC,OAAO,SAASC,oBAAoBA,CAACC,aAAa,EAAEC,UAAU,EAAE;EAC9D,IAAIC,WAAW,GAAG,IAAIJ,IAAI,CAAC,CAAC;EAE5B,IAAIK,KAAK,GAAG,IAAIR,KAAK,CAACK,aAAa,CAACI,MAAM,CAAC;EAC3CH,UAAU,CAACI,OAAO,CAAC,UAAAC,IAAI,EAAI;IACzBH,KAAK,CAACI,OAAO,CAACD,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/BH,KAAK,CAACI,OAAO,CAACD,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC;EACjC,CAAC,CAAC;EAEFH,KAAK,CAACK,GAAG,CAAC,CAAC;EAEX,IAAIC,SAAS,GAAGN,KAAK,CAACM,SAAS,CAACC,MAAM,CAAC,UAAAC,QAAQ;IAAA,OAAIA,QAAQ,CAACP,MAAM,IAAI,CAAC;EAAA,EAAC;EACxE,IAAIQ,qBAAqB,GAAGhB,mBAAmB,CAACa,SAAS,EAAEN,KAAK,CAAC;EAEjE,IAAIU,KAAK,GAAG,EAAE;EACdD,qBAAqB,CAACP,OAAO,CAAC,UAAAS,EAAE,EAAI;IAClCA,EAAE,CAACT,OAAO,CAAC,UAAAU,IAAI;MAAA,OAAIF,KAAK,CAACG,IAAI,CAACD,IAAI,CAAC;IAAA,EAAC;EACtC,CAAC,CAAC;EAEF,IAAIE,MAAM,GAAGpB,WAAW,CAACG,aAAa,EAAEa,KAAK,CAAC;EAC9CI,MAAM,CAACC,QAAQ,CAACb,OAAO,CAAC,UAAAc,KAAK,EAAI;IAC/BA,KAAK,CAACC,KAAK,CAAC,CAAC;IACblB,WAAW,GAAGA,WAAW,CAACc,IAAI,CAACG,KAAK,CAAC;EACvC,CAAC,CAAC;EAEF,OAAOjB,WAAW;AACpB;AAEA,OAAO,SAASmB,gBAAgBA,CAACC,oBAAoB,EAAE;EACrD;;EAEA,IAAIC,CAAC,GAAG,CAAC;EACT,IAAIC,iBAAiB,GAAG,CAAC;EACzB,IAAIC,IAAI,GAAGH,oBAAoB,CAACG,IAAI;EAEpC,KAAKF,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGE,IAAI,EAAEF,CAAC,EAAE,EAAE;IACzB,IAAAG,qBAAA,GAAuBJ,oBAAoB,CAACK,GAAG,CAACJ,CAAC,CAAC;MAAzCK,EAAE,GAAAF,qBAAA,CAALG,CAAC;MAASC,EAAE,GAAAJ,qBAAA,CAALK,CAAC;IACd,IAAAC,sBAAA,GAAuBV,oBAAoB,CAACK,GAAG,CAAC,CAACJ,CAAC,GAAG,CAAC,IAAIE,IAAI,CAAC;MAAtDQ,EAAE,GAAAD,sBAAA,CAALH,CAAC;MAASK,EAAE,GAAAF,sBAAA,CAALD,CAAC;IAEdP,iBAAiB,IAAI,CAACS,EAAE,GAAGL,EAAE,KAAKM,EAAE,GAAGJ,EAAE,CAAC;EAC5C;EAEA,OAAON,iBAAiB,GAAG,CAAC;AAC9B","ignoreList":[]}

package/es/utils/graph.js

@@ -1,150 +0,0 @@
-function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
-function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
-function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
-function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
-//JS porting of this code http://www.geeksforgeeks.org/biconnected-components/
-
-function create_array(length) {
-  var array = [];
-  for (var i = 0; i < length; ++i) {
-    array.push([]);
-  }
-  return array;
-}
-var Edge = /*#__PURE__*/_createClass(function Edge(u, v) {
-  _classCallCheck(this, Edge);
-  this.u = u;
-  this.v = v;
-});
-var Graph = /*#__PURE__*/function () {
-  function Graph(v) {
-    _classCallCheck(this, Graph);
-    this.count = 0; // count is number of biconnected components
-    this.subgraphs = []; //biconnected components
-    this.time = 0; // time is used to find discovery times
-
-    this.V = v; // No. of vertices
-    this.E = 0; // No. of Edges
-    this.adj = []; // Adjacency List
-
-    this.adj = create_array(v);
-  }
-
-  //Function to add an edge into the graph
-  return _createClass(Graph, [{
-    key: "addEdge",
-    value: function addEdge(v, w) {
-      this.adj[v].push(w);
-      this.E++;
-    }
-
-    // A recursive function that finds and prints strongly connected
-    // components using DFS traversal
-    // u --> The vertex to be visited next
-    // disc[] --> Stores discovery times of visited vertices
-    // low[] -- >> earliest visited vertex (the vertex with minimum
-    //             discovery time) that can be reached from subtree
-    //             rooted with current vertex
-    // *st -- >> To store visited edges
-    // // A recursive function that finds and prints strongly connected
-    // components using DFS traversal
-    // u --> The vertex to be visited next
-    // disc[] --> Stores discovery times of visited vertices
-    // low[] -- >> earliest visited vertex (the vertex with minimum
-    //             discovery time) that can be reached from subtree
-    //             rooted with current vertex
-    // *st -- >> To store visited edges
-  }, {
-    key: "_BCCUtil",
-    value: function _BCCUtil(u, disc, low, st, parent) {
-      var _this = this;
-      // Initialize discovery time and low value
-      disc[u] = low[u] = ++this.time;
-      this.children = 0;
-
-      // Go through all vertices adjacent to this
-      // v is current adjacent of 'u'
-      this.adj[u].forEach(function (v) {
-        // If v is not visited yet, then recur for it
-        if (disc[v] == -1) {
-          _this.children++;
-          parent[v] = u;
-
-          // store the edge in stack
-          st.push(new Edge(u, v));
-          _this._BCCUtil(v, disc, low, st, parent);
-
-          // Check if the subtree rooted with 'v' has a
-          // connection to one of the ancestors of 'u'
-          // Case 1 -- per Strongly Connected Components Article
-          if (low[u] > low[v]) low[u] = low[v];
-
-          // If u is an articulation point,
-          // pop all edges from stack till u -- v
-          if (disc[u] == 1 && _this.children > 1 || disc[u] > 1 && low[v] >= disc[u]) {
-            var subgraph = [];
-            while (st[st.length - 1].u != u || st[st.length - 1].v != v) {
-              subgraph.push(st[st.length - 1]);
-              //console.log(st[st.length - 1].u + "--" + st[st.length - 1].v + " ");
-              st.splice(st.length - 1, 1);
-            }
-            subgraph.push(st[st.length - 1]);
-            //console.log(st[st.length - 1].u + "--" + st[st.length - 1].v + " ");
-            _this.subgraphs.push(subgraph);
-            subgraph = [];
-            //console.log()
-            st.splice(st.length - 1, 1);
-            _this.count++;
-          }
-        }
-
-        // Update low value of 'u' only of 'v' is still in stack
-        // (i.e. it's a back edge, not cross edge).
-        // Case 2 -- per Strongly Connected Components Article
-        else if (v != parent[u] && disc[v] < low[u]) {
-          if (low[u] > disc[v]) low[u] = disc[v];
-          st.push(new Edge(u, v));
-        }
-      });
-    }
-  }, {
-    key: "BCC",
-    value: function BCC() {
-      var V = this.V;
-      var disc = create_array(V);
-      var low = create_array(V);
-      var parent = create_array(V);
-      var st = [];
-
-      // Initialize disc and low, and parent arrays
-      for (var i = 0; i < V; i++) {
-        disc[i] = -1;
-        low[i] = -1;
-        parent[i] = -1;
-      }
-      for (var _i = 0; _i < V; _i++) {
-        if (disc[_i] == -1) this._BCCUtil(_i, disc, low, st, parent);
-        var j = 0;
-
-        // If stack is not empty, pop all edges from stack
-        var subgraph = [];
-        while (st.length > 0) {
-          j = 1;
-          subgraph.push(st[st.length - 1]);
-          //console.log(st[st.length - 1].u + "--" + st[st.length - 1].v + " ");
-          st.splice(st.length - 1, 1);
-        }
-        if (j == 1) {
-          this.subgraphs.push(subgraph);
-          subgraph = [];
-          //console.log();
-          this.count++;
-        }
-      }
-    }
-  }]);
-}();
-module.exports = Graph;
-//# sourceMappingURL=graph.js.map

package/es/utils/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","names":["create_array","length","array","i","push","Edge","_createClass","u","v","_classCallCheck","Graph","count","subgraphs","time","V","E","adj","key","value","addEdge","w","_BCCUtil","disc","low","st","parent","_this","children","forEach","subgraph","splice","BCC","j","module","exports"],"sources":["../../src/utils/graph.js"],"sourcesContent":["//JS porting of this code http://www.geeksforgeeks.org/biconnected-components/\r\n\r\nfunction create_array(length) {\r\n  let array = [];\r\n  for (let i = 0; i < length; ++i) {\r\n    array.push([]);\r\n  }\r\n  return array;\r\n}\r\n\r\nclass Edge {\r\n  constructor(u, v) {\r\n    this.u = u;\r\n    this.v = v;\r\n  }\r\n}\r\n\r\nclass Graph {\r\n  constructor(v) {\r\n    this.count = 0; // count is number of biconnected components\r\n    this.subgraphs = []; //biconnected components\r\n    this.time = 0; // time is used to find discovery times\r\n\r\n    this.V = v; // No. of vertices\r\n    this.E = 0; // No. of Edges\r\n    this.adj = []; // Adjacency List\r\n\r\n    this.adj = create_array(v);\r\n  }\r\n\r\n  //Function to add an edge into the graph\r\n  addEdge(v, w) {\r\n    this.adj[v].push(w);\r\n    this.E++;\r\n  }\r\n\r\n  // A recursive function that finds and prints strongly connected\r\n  // components using DFS traversal\r\n  // u --> The vertex to be visited next\r\n  // disc[] --> Stores discovery times of visited vertices\r\n  // low[] -- >> earliest visited vertex (the vertex with minimum\r\n  //             discovery time) that can be reached from subtree\r\n  //             rooted with current vertex\r\n  // *st -- >> To store visited edges\r\n  // // A recursive function that finds and prints strongly connected\r\n  // components using DFS traversal\r\n  // u --> The vertex to be visited next\r\n  // disc[] --> Stores discovery times of visited vertices\r\n  // low[] -- >> earliest visited vertex (the vertex with minimum\r\n  //             discovery time) that can be reached from subtree\r\n  //             rooted with current vertex\r\n  // *st -- >> To store visited edges\r\n  _BCCUtil(u, disc, low, st, parent) {\r\n    // Initialize discovery time and low value\r\n    disc[u] = low[u] = ++this.time;\r\n    this.children = 0;\r\n\r\n    // Go through all vertices adjacent to this\r\n    // v is current adjacent of 'u'\r\n    this.adj[u].forEach(v => {\r\n      // If v is not visited yet, then recur for it\r\n      if (disc[v] == -1) {\r\n        this.children++;\r\n        parent[v] = u;\r\n\r\n        // store the edge in stack\r\n        st.push(new Edge(u, v));\r\n        this._BCCUtil(v, disc, low, st, parent);\r\n\r\n        // Check if the subtree rooted with 'v' has a\r\n        // connection to one of the ancestors of 'u'\r\n        // Case 1 -- per Strongly Connected Components Article\r\n        if (low[u] > low[v]) low[u] = low[v];\r\n\r\n        // If u is an articulation point,\r\n        // pop all edges from stack till u -- v\r\n        if (\r\n          (disc[u] == 1 && this.children > 1) ||\r\n          (disc[u] > 1 && low[v] >= disc[u])\r\n        ) {\r\n          let subgraph = [];\r\n          while (st[st.length - 1].u != u || st[st.length - 1].v != v) {\r\n            subgraph.push(st[st.length - 1]);\r\n            //console.log(st[st.length - 1].u + \"--\" + st[st.length - 1].v + \" \");\r\n            st.splice(st.length - 1, 1);\r\n          }\r\n\r\n          subgraph.push(st[st.length - 1]);\r\n          //console.log(st[st.length - 1].u + \"--\" + st[st.length - 1].v + \" \");\r\n          this.subgraphs.push(subgraph);\r\n          subgraph = [];\r\n          //console.log()\r\n          st.splice(st.length - 1, 1);\r\n\r\n          this.count++;\r\n        }\r\n      }\r\n\r\n      // Update low value of 'u' only of 'v' is still in stack\r\n      // (i.e. it's a back edge, not cross edge).\r\n      // Case 2 -- per Strongly Connected Components Article\r\n      else if (v != parent[u] && disc[v] < low[u]) {\r\n        if (low[u] > disc[v]) low[u] = disc[v];\r\n        st.push(new Edge(u, v));\r\n      }\r\n    });\r\n  }\r\n\r\n  BCC() {\r\n    let V = this.V;\r\n    let disc = create_array(V);\r\n    let low = create_array(V);\r\n    let parent = create_array(V);\r\n    let st = [];\r\n\r\n    // Initialize disc and low, and parent arrays\r\n    for (let i = 0; i < V; i++) {\r\n      disc[i] = -1;\r\n      low[i] = -1;\r\n      parent[i] = -1;\r\n    }\r\n\r\n    for (let i = 0; i < V; i++) {\r\n      if (disc[i] == -1) this._BCCUtil(i, disc, low, st, parent);\r\n\r\n      let j = 0;\r\n\r\n      // If stack is not empty, pop all edges from stack\r\n      let subgraph = [];\r\n      while (st.length > 0) {\r\n        j = 1;\r\n        subgraph.push(st[st.length - 1]);\r\n        //console.log(st[st.length - 1].u + \"--\" + st[st.length - 1].v + \" \");\r\n        st.splice(st.length - 1, 1);\r\n      }\r\n\r\n      if (j == 1) {\r\n        this.subgraphs.push(subgraph);\r\n        subgraph = [];\r\n        //console.log();\r\n        this.count++;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nmodule.exports = Graph;\r\n"],"mappings":";;;;;;AAAA;;AAEA,SAASA,YAAYA,CAACC,MAAM,EAAE;EAC5B,IAAIC,KAAK,GAAG,EAAE;EACd,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,MAAM,EAAE,EAAEE,CAAC,EAAE;IAC/BD,KAAK,CAACE,IAAI,CAAC,EAAE,CAAC;EAChB;EACA,OAAOF,KAAK;AACd;AAAC,IAEKG,IAAI,gBAAAC,YAAA,CACR,SAAAD,KAAYE,CAAC,EAAEC,CAAC,EAAE;EAAAC,eAAA,OAAAJ,IAAA;EAChB,IAAI,CAACE,CAAC,GAAGA,CAAC;EACV,IAAI,CAACC,CAAC,GAAGA,CAAC;AACZ,CAAC;AAAA,IAGGE,KAAK;EACT,SAAAA,MAAYF,CAAC,EAAE;IAAAC,eAAA,OAAAC,KAAA;IACb,IAAI,CAACC,KAAK,GAAG,CAAC,CAAC,CAAC;IAChB,IAAI,CAACC,SAAS,GAAG,EAAE,CAAC,CAAC;IACrB,IAAI,CAACC,IAAI,GAAG,CAAC,CAAC,CAAC;;IAEf,IAAI,CAACC,CAAC,GAAGN,CAAC,CAAC,CAAC;IACZ,IAAI,CAACO,CAAC,GAAG,CAAC,CAAC,CAAC;IACZ,IAAI,CAACC,GAAG,GAAG,EAAE,CAAC,CAAC;;IAEf,IAAI,CAACA,GAAG,GAAGhB,YAAY,CAACQ,CAAC,CAAC;EAC5B;;EAEA;EAAA,OAAAF,YAAA,CAAAI,KAAA;IAAAO,GAAA;IAAAC,KAAA,EACA,SAAAC,OAAOA,CAACX,CAAC,EAAEY,CAAC,EAAE;MACZ,IAAI,CAACJ,GAAG,CAACR,CAAC,CAAC,CAACJ,IAAI,CAACgB,CAAC,CAAC;MACnB,IAAI,CAACL,CAAC,EAAE;IACV;;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;EAAA;IAAAE,GAAA;IAAAC,KAAA,EACA,SAAAG,QAAQA,CAACd,CAAC,EAAEe,IAAI,EAAEC,GAAG,EAAEC,EAAE,EAAEC,MAAM,EAAE;MAAA,IAAAC,KAAA;MACjC;MACAJ,IAAI,CAACf,CAAC,CAAC,GAAGgB,GAAG,CAAChB,CAAC,CAAC,GAAG,EAAE,IAAI,CAACM,IAAI;MAC9B,IAAI,CAACc,QAAQ,GAAG,CAAC;;MAEjB;MACA;MACA,IAAI,CAACX,GAAG,CAACT,CAAC,CAAC,CAACqB,OAAO,CAAC,UAAApB,CAAC,EAAI;QACvB;QACA,IAAIc,IAAI,CAACd,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;UACjBkB,KAAI,CAACC,QAAQ,EAAE;UACfF,MAAM,CAACjB,CAAC,CAAC,GAAGD,CAAC;;UAEb;UACAiB,EAAE,CAACpB,IAAI,CAAC,IAAIC,IAAI,CAACE,CAAC,EAAEC,CAAC,CAAC,CAAC;UACvBkB,KAAI,CAACL,QAAQ,CAACb,CAAC,EAAEc,IAAI,EAAEC,GAAG,EAAEC,EAAE,EAAEC,MAAM,CAAC;;UAEvC;UACA;UACA;UACA,IAAIF,GAAG,CAAChB,CAAC,CAAC,GAAGgB,GAAG,CAACf,CAAC,CAAC,EAAEe,GAAG,CAAChB,CAAC,CAAC,GAAGgB,GAAG,CAACf,CAAC,CAAC;;UAEpC;UACA;UACA,IACGc,IAAI,CAACf,CAAC,CAAC,IAAI,CAAC,IAAImB,KAAI,CAACC,QAAQ,GAAG,CAAC,IACjCL,IAAI,CAACf,CAAC,CAAC,GAAG,CAAC,IAAIgB,GAAG,CAACf,CAAC,CAAC,IAAIc,IAAI,CAACf,CAAC,CAAE,EAClC;YACA,IAAIsB,QAAQ,GAAG,EAAE;YACjB,OAAOL,EAAE,CAACA,EAAE,CAACvB,MAAM,GAAG,CAAC,CAAC,CAACM,CAAC,IAAIA,CAAC,IAAIiB,EAAE,CAACA,EAAE,CAACvB,MAAM,GAAG,CAAC,CAAC,CAACO,CAAC,IAAIA,CAAC,EAAE;cAC3DqB,QAAQ,CAACzB,IAAI,CAACoB,EAAE,CAACA,EAAE,CAACvB,MAAM,GAAG,CAAC,CAAC,CAAC;cAChC;cACAuB,EAAE,CAACM,MAAM,CAACN,EAAE,CAACvB,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B;YAEA4B,QAAQ,CAACzB,IAAI,CAACoB,EAAE,CAACA,EAAE,CAACvB,MAAM,GAAG,CAAC,CAAC,CAAC;YAChC;YACAyB,KAAI,CAACd,SAAS,CAACR,IAAI,CAACyB,QAAQ,CAAC;YAC7BA,QAAQ,GAAG,EAAE;YACb;YACAL,EAAE,CAACM,MAAM,CAACN,EAAE,CAACvB,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;YAE3ByB,KAAI,CAACf,KAAK,EAAE;UACd;QACF;;QAEA;QACA;QACA;QAAA,KACK,IAAIH,CAAC,IAAIiB,MAAM,CAAClB,CAAC,CAAC,IAAIe,IAAI,CAACd,CAAC,CAAC,GAAGe,GAAG,CAAChB,CAAC,CAAC,EAAE;UAC3C,IAAIgB,GAAG,CAAChB,CAAC,CAAC,GAAGe,IAAI,CAACd,CAAC,CAAC,EAAEe,GAAG,CAAChB,CAAC,CAAC,GAAGe,IAAI,CAACd,CAAC,CAAC;UACtCgB,EAAE,CAACpB,IAAI,CAAC,IAAIC,IAAI,CAACE,CAAC,EAAEC,CAAC,CAAC,CAAC;QACzB;MACF,CAAC,CAAC;IACJ;EAAC;IAAAS,GAAA;IAAAC,KAAA,EAED,SAAAa,GAAGA,CAAA,EAAG;MACJ,IAAIjB,CAAC,GAAG,IAAI,CAACA,CAAC;MACd,IAAIQ,IAAI,GAAGtB,YAAY,CAACc,CAAC,CAAC;MAC1B,IAAIS,GAAG,GAAGvB,YAAY,CAACc,CAAC,CAAC;MACzB,IAAIW,MAAM,GAAGzB,YAAY,CAACc,CAAC,CAAC;MAC5B,IAAIU,EAAE,GAAG,EAAE;;MAEX;MACA,KAAK,IAAIrB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGW,CAAC,EAAEX,CAAC,EAAE,EAAE;QAC1BmB,IAAI,CAACnB,CAAC,CAAC,GAAG,CAAC,CAAC;QACZoB,GAAG,CAACpB,CAAC,CAAC,GAAG,CAAC,CAAC;QACXsB,MAAM,CAACtB,CAAC,CAAC,GAAG,CAAC,CAAC;MAChB;MAEA,KAAK,IAAIA,EAAC,GAAG,CAAC,EAAEA,EAAC,GAAGW,CAAC,EAAEX,EAAC,EAAE,EAAE;QAC1B,IAAImB,IAAI,CAACnB,EAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAACkB,QAAQ,CAAClB,EAAC,EAAEmB,IAAI,EAAEC,GAAG,EAAEC,EAAE,EAAEC,MAAM,CAAC;QAE1D,IAAIO,CAAC,GAAG,CAAC;;QAET;QACA,IAAIH,QAAQ,GAAG,EAAE;QACjB,OAAOL,EAAE,CAACvB,MAAM,GAAG,CAAC,EAAE;UACpB+B,CAAC,GAAG,CAAC;UACLH,QAAQ,CAACzB,IAAI,CAACoB,EAAE,CAACA,EAAE,CAACvB,MAAM,GAAG,CAAC,CAAC,CAAC;UAChC;UACAuB,EAAE,CAACM,MAAM,CAACN,EAAE,CAACvB,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B;QAEA,IAAI+B,CAAC,IAAI,CAAC,EAAE;UACV,IAAI,CAACpB,SAAS,CAACR,IAAI,CAACyB,QAAQ,CAAC;UAC7BA,QAAQ,GAAG,EAAE;UACb;UACA,IAAI,CAAClB,KAAK,EAAE;QACd;MACF;IACF;EAAC;AAAA;AAGHsB,MAAM,CAACC,OAAO,GAAGxB,KAAK","ignoreList":[]}