plebeiangraphlibrary 2.2.0 → 2.2.2

package/CHANGELOG.md

@@ -0,0 +1,30 @@
+# Changelog
+
+All notable changes to the Plebeian Graph Library (PGL) will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [2.2.2] - 2025-02-28
+
+### Added
+
+- **remove_node(nodeId)** — Remove a node and all incident edges. Updates adjacency lists for remaining nodes. Returns `true` if the node existed and was removed.
+- **remove_edge(edgeId)** — Remove an edge by ID. Updates adjacency lists. Returns `true` if the edge existed and was removed.
+- **NodeData** and **EdgeData** types — Exported for typed node/edge data when using add_node and add_edge.
+- **exports** field in package.json — Cleaner ESM/CJS resolution for bundlers.
+
+### Changed
+
+- **add_edge** — Uses internal edge ID counter to avoid collisions when edges are removed.
+- **LoadDwt1005** — Now lazy-loaded via dynamic import; DWT 1005 dataset is in a separate chunk and only loaded when called (reduces main bundle size).
+- **get_position_map** — Skips nodes without `data.pos` instead of returning undefined.
+- **constructAdjacencyList** — Added `await Promise.resolve()` between passes to yield to the event loop on large graphs.
+- **4_ToggleActivation.html** — Fixed missing `await` on `G.initialize()`.
+
+### Fixed
+
+- Edge ID collisions when removing and re-adding edges (now uses monotonic counter).
+- Potential browser hang during adjacency construction on very large graphs (yield point added).
+
+[2.2.2]: https://github.com/range-et/PGL/compare/v2.2.1...v2.2.2

package/Examples/4_ToggleActivation.html

@@ -27,7 +27,7 @@
         const G = await PGL.Models.GenerateErdosReyni_n_p(1000, 0.02);
         // since these graphs can be really large - they are not initialized 
         // so you must initialize them
-        G.initialize();
+        await G.initialize();
         G.printData();
 
         // now in this case we shall use the Kamada Kawai algorithm to initilaize all the positions

package/README.md

@@ -22,15 +22,15 @@ The documentation for the package is available at [documentation](https://www.pl
 npm run document
 ```
 
-This writes TypeDoc output to the `docs/` folder. **API overview:** the library exposes the following namespaces: `Graph`, `GraphMethods` (BFS, Dijkstra, GraphDiameter, SelectSubgraph — note: `Dijkstra` returns hop-count distances via BFS for unweighted graphs), `SampleData` (LoadZKC, LoadZKCSimulated, LoadGraphFromEdgeListText for (sgd)²-style edge lists, LoadGraphFromObjText for OBJ meshes → graph + positions), `Constructors` (ConstructGraphNodeEdgesList), `Drawing` (SimulateKamadaKawai, DrawEdgeLines, DrawEdgeBundling, DisplaceEdgeInY, etc.), `Geometry`, `Utilities`, `ThreeWrapper`, `GraphDrawer`, **Interaction** (opt-in: `enableInteraction`, `disableInteraction`; types `NodePickDetails`, `EdgePickDetails`, `InteractionOptions` for click/hover/drag callbacks), `Models` (Erdos–Renyi), `Hierarchy` (clusterByDistance, clusterByStrategy for flow-map style clustering), **Simulation** (createKamadaKawai3D, createStressSGD3D — stress layout methods from (sgd)², Imperial), **MatrixHelpers** (matrixVectorMultiply, normalizeVector), and **glMatrix** (re-exported [gl-matrix](https://github.com/toji/gl-matrix) for vector/matrix math in the browser).
+This writes TypeDoc output to the `docs/` folder. **API overview:** the library exposes the following namespaces: `Graph` (add_node, add_edge, remove_node, remove_edge, get_position_map, apply_position_map, etc.), `GraphMethods` (BFS, Dijkstra, GraphDiameter, SelectSubgraph — note: `Dijkstra` returns hop-count distances via BFS for unweighted graphs), `SampleData` (LoadZKC, LoadZKCSimulated, LoadGraphFromEdgeListText for (sgd)²-style edge lists, LoadGraphFromObjText for OBJ meshes → graph + positions, LoadDwt1005 — lazy-loaded), `Constructors` (ConstructGraphNodeEdgesList), `Drawing` (SimulateKamadaKawai, DrawEdgeLines, DrawEdgeBundling, DisplaceEdgeInY, etc.), `Geometry`, `Utilities`, `ThreeWrapper`, `GraphDrawer`, **Interaction** (opt-in: `enableInteraction`, `disableInteraction`; types `NodePickDetails`, `EdgePickDetails`, `InteractionOptions` for click/hover/drag callbacks), `Models` (Erdos–Renyi), `Hierarchy` (clusterByDistance, clusterByStrategy for flow-map style clustering), **Simulation** (createKamadaKawai3D, createStressSGD3D — stress layout methods from (sgd)², Imperial), **MatrixHelpers** (matrixVectorMultiply, normalizeVector), and **glMatrix** (re-exported [gl-matrix](https://github.com/toji/gl-matrix) for vector/matrix math in the browser).
 
 ### Graph simulations
 
 For time-based layout updates (e.g. in a `requestAnimationFrame` loop), use **createKamadaKawai3D(graph, options)** or **createStressSGD3D(graph, options)** (async). Both return an object with **step(deltaTime)**, **getPositions()** (Float32Array), and **getPositionMap()**. The Stress SGD layout follows the (sgd)² reference implementation from Imperial ([arXiv:1710.04626](https://arxiv.org/abs/1710.04626), [IEEE TVCG](https://www.computer.org/csdl/journal/tg/2019/09/08419285/13rRUyYBlgE), [github.com/jxz12/s_gd2](https://github.com/jxz12/s_gd2)). Use **DrawTHREEGraphVerticesMutable** so you can call **updatePositions(simulation.getPositions())** each frame without recreating geometry. For 3D layout that does not collapse to a line, pass **initialPositions** (e.g. from **LoadGraphFromObjText**) and use **dimensions: 3**. See Examples 9 (Kamada–Kawai live simulation), 11 (custom layout), 12 (Stress SGD live simulation), and 13 (Stress SGD 3D with Stanford Bunny mesh).
 
-### Types (Point, PointLike)
+### Types (Point, PointLike, NodeData, EdgeData)
 
-The library exports **Point** (class with `x`, `y`, `z` and `translate()`) and **PointLike** (`{ x: number; y: number; z: number }`) for typing position maps and custom layout results. Use `PointLike` for plain objects; use `new PGL.Point(x, y, z)` when you need the class.
+The library exports **Point** (class with `x`, `y`, `z` and `translate()`), **PointLike** (`{ x: number; y: number; z: number }`), **NodeData** (typed shape for node data; `pos` optional), and **EdgeData** (typed shape for edge data; `ldata` optional for line geometry). Use `PointLike` for plain objects; use `new PGL.Point(x, y, z)` when you need the class.
 
 ### Drawing API: static vs mutable
 

package/package.json

@@ -1,11 +1,17 @@
 {
   "name": "plebeiangraphlibrary",
-  "version": "2.2.0",
+  "version": "2.2.2",
   "description": "A NetworkX like package for graphs in javascript",
   "source": "./Src/index.ts",
   "main": "./Build/pgl.js",
   "types": "./Build/index.d.ts",
   "module": "./Build/pgl_module.js",
+  "exports": {
+    ".": {
+      "import": { "types": "./Build/index.d.ts", "default": "./Build/pgl_module.js" },
+      "require": { "types": "./Build/index.d.ts", "default": "./Build/pgl.js" }
+    }
+  },
   "scripts": {
     "watch": "vite build --watch",
     "build": "rm -rf Build && vite build",
@@ -33,6 +39,7 @@
     "Build/",
     "Examples/",
     "README.md",
+    "CHANGELOG.md",
     "CODE_OF_CONDUCT.md",
     "CONTRIBUTING.md",
     "LICENSE"