@woosh/meep-engine 2.77.0 → 2.78.0

package/build/meep.module.js

@@ -70695,6 +70695,14 @@ class NodeContainer {
      */
     __neighbors = new Map();
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {N[]}
+     */
+    get neighbours() {
+        return Array.from(this.__neighbors.keys());
+    }
+
     /**
      *
      * @return {number}
@@ -70712,7 +70720,7 @@ class NodeContainer {
     }
 
     /**
-     *
+     * NOTE: this method allocates memory internally
      * @returns {N[]}
      */
     get inNodes() {
@@ -70720,7 +70728,7 @@ class NodeContainer {
     }
 
     /**
-     *
+     * NOTE: this method allocates memory internally
      * @returns {N[]}
      */
     get outNodes() {
@@ -70728,6 +70736,10 @@ class NodeContainer {
     }
 
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {Edge<N>[]}
+     */
     get outEdges() {
         /**
          *
@@ -70740,6 +70752,10 @@ class NodeContainer {
         return result;
     }
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {Edge<N>[]}
+     */
     get inEdges() {
         /**
          *
@@ -71155,6 +71171,14 @@ class Graph {
         return container.getEdgeCount();
     }
 
+    /**
+     *
+     * @returns {N[]}
+     */
+    get nodes() {
+        return Array.from(this.getNodes());
+    }
+
     /**
      * Do not modify this set directly
      * @return {Iterable<N>}
@@ -71360,6 +71384,21 @@ class Graph {
         return edge_count;
     }
 
+    /**
+     *
+     * @param {N} node
+     * @returns {N[]}
+     */
+    getNeighbours(node) {
+        const container = this.__nodes.get(node);
+
+        if (container === undefined) {
+            return [];
+        }
+
+        return container.neighbours;
+    }
+
     /**
      *
      * @param {N} node

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.77.0",
+  "version": "2.78.0",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

package/src/core/graph/coloring/colorizeGraphGreedy.spec.js

@@ -1,4 +1,4 @@
-import Graph from "../Graph.js";
+import { Graph } from "../v2/Graph.js";
 import { colorizeGraphGreedy } from "./colorizeGraphGreedy.js";
 
 test('empty graph', () => {

package/src/core/graph/layout/CircleLayout.js

@@ -1,21 +1,16 @@
-/**
- *
- * @param {Array.<Circle>} input
- * @param {Graph} graph
- */
 import { assert } from "../../assert.js";
-import Circle from "../../geom/2d/circle/Circle.js";
 import AABB2 from "../../geom/2d/aabb/AABB2.js";
+import Circle from "../../geom/2d/circle/Circle.js";
+import {
+    line_segment_line_segment_intersection_exists_2d
+} from "../../geom/2d/line/line_segment_line_segment_intersection_exists_2d.js";
 import Vector2, { v2_distance } from "../../geom/Vector2.js";
 import { max2 } from "../../math/max2.js";
 import { min2 } from "../../math/min2.js";
+import { applyCentralGravityAABB2 } from "./box/applyCentralGravityAABB2.js";
+import { resolveAABB2Overlap } from "./box/resolveAABB2Overlap.js";
 import { computeDisconnectedSubGraphs } from "./computeDisconnectedSubGraphs.js";
 import { Connection } from "./Connection.js";
-import { resolveAABB2Overlap } from "./box/resolveAABB2Overlap.js";
-import { applyCentralGravityAABB2 } from "./box/applyCentralGravityAABB2.js";
-import {
-    line_segment_line_segment_intersection_exists_2d
-} from "../../geom/2d/line/line_segment_line_segment_intersection_exists_2d.js";
 
 
 /**

package/src/core/graph/v2/Graph.js

@@ -179,6 +179,14 @@ export class Graph {
         return container.getEdgeCount();
     }
 
+    /**
+     *
+     * @returns {N[]}
+     */
+    get nodes() {
+        return Array.from(this.getNodes());
+    }
+
     /**
      * Do not modify this set directly
      * @return {Iterable<N>}
@@ -390,6 +398,21 @@ export class Graph {
         return edge_count;
     }
 
+    /**
+     *
+     * @param {N} node
+     * @returns {N[]}
+     */
+    getNeighbours(node) {
+        const container = this.__nodes.get(node);
+
+        if (container === undefined) {
+            return [];
+        }
+
+        return container.neighbours;
+    }
+
     /**
      *
      * @param {N} node

package/src/core/graph/v2/NodeContainer.js

@@ -26,6 +26,14 @@ export class NodeContainer {
      */
     __neighbors = new Map();
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {N[]}
+     */
+    get neighbours() {
+        return Array.from(this.__neighbors.keys());
+    }
+
     /**
      *
      * @return {number}
@@ -43,7 +51,7 @@ export class NodeContainer {
     }
 
     /**
-     *
+     * NOTE: this method allocates memory internally
      * @returns {N[]}
      */
     get inNodes() {
@@ -51,7 +59,7 @@ export class NodeContainer {
     }
 
     /**
-     *
+     * NOTE: this method allocates memory internally
      * @returns {N[]}
      */
     get outNodes() {
@@ -59,6 +67,10 @@ export class NodeContainer {
     }
 
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {Edge<N>[]}
+     */
     get outEdges() {
         /**
          *
@@ -71,6 +83,10 @@ export class NodeContainer {
         return result;
     }
 
+    /**
+     * NOTE: this method allocates memory internally
+     * @returns {Edge<N>[]}
+     */
     get inEdges() {
         /**
          *