@atlaspack/graph 3.2.1-dev.3566 → 3.3.0

package/CHANGELOG.md

@@ -0,0 +1,12 @@
+# @atlaspack/graph
+
+## 3.3.0
+
+### Minor Changes
+
+- [#335](https://github.com/atlassian-labs/atlaspack/pull/335) [`b4dbd4d`](https://github.com/atlassian-labs/atlaspack/commit/b4dbd4d5b23d1b7aa3fcdf59cc7bc8bedd3a59cf) Thanks [@yamadapc](https://github.com/yamadapc)! - Initial changeset release
+
+### Patch Changes
+
+- Updated dependencies [[`b4dbd4d`](https://github.com/atlassian-labs/atlaspack/commit/b4dbd4d5b23d1b7aa3fcdf59cc7bc8bedd3a59cf)]:
+  - @atlaspack/feature-flags@2.13.0

package/lib/AdjacencyList.js

@@ -268,7 +268,7 @@ class AdjacencyList {
    * Returns `true` if the edge was added,
    * or `false` if the edge already exists.
    */
-  addEdge(from, to, type = 1) {
+  addEdge(from, to, type = _Graph.NULL_EDGE_TYPE) {
     (0, _assert().default)(from < this.#nodes.nextId, `Node ${from} does not exist.`);
     (0, _assert().default)(to < this.#nodes.nextId, `Node ${to} does not exist.`);
     (0, _assert().default)(type > 0, `Unsupported edge type ${type}`);
@@ -316,7 +316,7 @@ class AdjacencyList {
   /**
    * Check if the graph has an edge connecting the `from` and `to` nodes.
    */
-  hasEdge(from, to, type = 1) {
+  hasEdge(from, to, type = _Graph.NULL_EDGE_TYPE) {
     let hasEdge = type => {
       let hash = this.#edges.hash(from, to, type);
       return this.#edges.addressOf(hash, from, to, type) !== null;
@@ -335,7 +335,7 @@ class AdjacencyList {
    *
    * This method will increment the edge delete count.
    */
-  removeEdge(from, to, type = 1) {
+  removeEdge(from, to, type = _Graph.NULL_EDGE_TYPE) {
     let hash = this.#edges.hash(from, to, type);
     let edge = this.#edges.addressOf(hash, from, to, type);
 
@@ -429,7 +429,7 @@ class AdjacencyList {
    * If `type` is an array, return nodes connected by edges of any of those types.
    * If `type` is `AllEdgeTypes` (`-1`), return nodes connected by edges of any type.
    */
-  getNodeIdsConnectedFrom(from, type = 1) {
+  getNodeIdsConnectedFrom(from, type = _Graph.NULL_EDGE_TYPE) {
     let matches = node => type === _Graph.ALL_EDGE_TYPES || (Array.isArray(type) ? type.includes(this.#nodes.typeOf(node)) : type === this.#nodes.typeOf(node));
     let nodes = [];
     let seen = new Set();
@@ -467,7 +467,7 @@ class AdjacencyList {
       node = this.#nodes.next(node);
     }
   }
-  forEachNodeIdConnectedTo(to, fn, type = 1) {
+  forEachNodeIdConnectedTo(to, fn, type = _Graph.NULL_EDGE_TYPE) {
     const matches = node => type === _Graph.ALL_EDGE_TYPES || type === this.#nodes.typeOf(node);
     let node = this.#nodes.head(to);
     while (node !== null) {
@@ -492,7 +492,7 @@ class AdjacencyList {
    * If `type` is an array, return nodes connected by edges of any of those types.
    * If `type` is `AllEdgeTypes` (`-1`), return nodes connected by edges of any type.
    */
-  getNodeIdsConnectedTo(to, type = 1) {
+  getNodeIdsConnectedTo(to, type = _Graph.NULL_EDGE_TYPE) {
     let matches = node => type === _Graph.ALL_EDGE_TYPES || (Array.isArray(type) ? type.includes(this.#nodes.typeOf(node)) : type === this.#nodes.typeOf(node));
     let nodes = [];
     let seen = new Set();

package/lib/ContentGraph.js

@@ -63,6 +63,9 @@ class ContentGraph extends _Graph.default {
       return super.getNode(nodeId);
     }
   }
+  getContentKeyByNodeId(nodeId) {
+    return (0, _nullthrows().default)(this._nodeIdToContentKey.get(nodeId), `Expected node id ${nodeId} to exist`);
+  }
   getNodeIdByContentKey(contentKey) {
     return (0, _nullthrows().default)(this._contentKeyToNodeId.get(contentKey), `Expected content key ${contentKey} to exist`);
   }

package/lib/Graph.js

@@ -3,7 +3,7 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.default = exports.ALL_EDGE_TYPES = void 0;
+exports.default = exports.NULL_EDGE_TYPE = exports.ALL_EDGE_TYPES = void 0;
 exports.mapVisitor = mapVisitor;
 var _types = require("./types");
 var _AdjacencyList = _interopRequireDefault(require("./AdjacencyList"));
@@ -16,6 +16,7 @@ function _nullthrows() {
   return data;
 }
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+const NULL_EDGE_TYPE = exports.NULL_EDGE_TYPE = 1;
 const ALL_EDGE_TYPES = exports.ALL_EDGE_TYPES = -1;
 
 /**
@@ -70,7 +71,7 @@ class Graph {
   getNode(id) {
     return this.nodes[id];
   }
-  addEdge(from, to, type = 1) {
+  addEdge(from, to, type = NULL_EDGE_TYPE) {
     if (Number(type) === 0) {
       throw new Error(`Edge type "${type}" not allowed`);
     }
@@ -82,25 +83,25 @@ class Graph {
     }
     return this.adjacencyList.addEdge(from, to, type);
   }
-  hasEdge(from, to, type = 1) {
+  hasEdge(from, to, type = NULL_EDGE_TYPE) {
     return this.adjacencyList.hasEdge(from, to, type);
   }
-  forEachNodeIdConnectedTo(to, fn, type = ALL_EDGE_TYPES) {
+  forEachNodeIdConnectedTo(to, fn, type = NULL_EDGE_TYPE) {
     this._assertHasNodeId(to);
     this.adjacencyList.forEachNodeIdConnectedTo(to, fn, type);
   }
-  forEachNodeIdConnectedFrom(from, fn, type = ALL_EDGE_TYPES) {
+  forEachNodeIdConnectedFrom(from, fn, type = NULL_EDGE_TYPE) {
     this._assertHasNodeId(from);
     this.adjacencyList.forEachNodeIdConnectedFromReverse(from, id => {
       fn(id);
       return false;
     }, type);
   }
-  getNodeIdsConnectedTo(nodeId, type = 1) {
+  getNodeIdsConnectedTo(nodeId, type = NULL_EDGE_TYPE) {
     this._assertHasNodeId(nodeId);
     return this.adjacencyList.getNodeIdsConnectedTo(nodeId, type);
   }
-  getNodeIdsConnectedFrom(nodeId, type = 1) {
+  getNodeIdsConnectedFrom(nodeId, type = NULL_EDGE_TYPE) {
     this._assertHasNodeId(nodeId);
     return this.adjacencyList.getNodeIdsConnectedFrom(nodeId, type);
   }
@@ -127,7 +128,7 @@ class Graph {
     }
     this.nodes[nodeId] = null;
   }
-  removeEdges(nodeId, type = 1) {
+  removeEdges(nodeId, type = NULL_EDGE_TYPE) {
     if (!this.hasNode(nodeId)) {
       return;
     }
@@ -135,7 +136,7 @@ class Graph {
       this._removeEdge(nodeId, to, type);
     }
   }
-  removeEdge(from, to, type = 1, removeOrphans = true) {
+  removeEdge(from, to, type = NULL_EDGE_TYPE, removeOrphans = true) {
     if (!this.adjacencyList.hasEdge(from, to, type)) {
       throw new Error(`Edge from ${(0, _types.fromNodeId)(from)} to ${(0, _types.fromNodeId)(to)} not found!`);
     }
@@ -143,7 +144,7 @@ class Graph {
   }
 
   // Removes edge and node the edge is to if the node is orphaned
-  _removeEdge(from, to, type = 1, removeOrphans = true) {
+  _removeEdge(from, to, type = NULL_EDGE_TYPE, removeOrphans = true) {
     if (!this.adjacencyList.hasEdge(from, to, type)) {
       return;
     }
@@ -183,7 +184,7 @@ class Graph {
   }
 
   // Update a node's downstream nodes making sure to prune any orphaned branches
-  replaceNodeIdsConnectedTo(fromNodeId, toNodeIds, replaceFilter, type = 1) {
+  replaceNodeIdsConnectedTo(fromNodeId, toNodeIds, replaceFilter, type = NULL_EDGE_TYPE, removeOrphans = true) {
     this._assertHasNodeId(fromNodeId);
     let outboundEdges = this.getNodeIdsConnectedFrom(fromNodeId, type);
     let childrenToRemove = new Set(replaceFilter ? outboundEdges.filter(toNodeId => replaceFilter(toNodeId)) : outboundEdges);
@@ -194,10 +195,10 @@ class Graph {
       }
     }
     for (let child of childrenToRemove) {
-      this._removeEdge(fromNodeId, child, type);
+      this._removeEdge(fromNodeId, child, type, removeOrphans);
     }
   }
-  traverse(visit, startNodeId, type = 1) {
+  traverse(visit, startNodeId, type = NULL_EDGE_TYPE) {
     let enter = typeof visit === 'function' ? visit : visit.enter;
     if (type === ALL_EDGE_TYPES && enter && (typeof visit === 'function' || !visit.exit)) {
       return this.dfsFast(enter, startNodeId);
@@ -212,7 +213,7 @@ class Graph {
   filteredTraverse(filter, visit, startNodeId, type) {
     return this.traverse(mapVisitor(filter, visit), startNodeId, type);
   }
-  traverseAncestors(startNodeId, visit, type = 1) {
+  traverseAncestors(startNodeId, visit, type = NULL_EDGE_TYPE) {
     return this.dfs({
       visit,
       startNodeId,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/graph",
-  "version": "3.2.1-dev.3566+facdfb05f",
+  "version": "3.3.0",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "(MIT OR Apache-2.0)",
   "publishConfig": {
@@ -16,8 +16,7 @@
     "node": ">= 16.0.0"
   },
   "dependencies": {
-    "@atlaspack/feature-flags": "2.12.1-dev.3566+facdfb05f",
+    "@atlaspack/feature-flags": "2.13.0",
     "nullthrows": "^1.1.1"
-  },
-  "gitHead": "facdfb05f693e50037a82a4afa101adf093fd8c9"
+  }
 }

package/src/AdjacencyList.js

@@ -3,7 +3,12 @@ import assert from 'assert';
 import nullthrows from 'nullthrows';
 import {SharedBuffer} from './shared-buffer';
 import {fromNodeId, toNodeId} from './types';
-import {ALL_EDGE_TYPES, type NullEdgeType, type AllEdgeTypes} from './Graph';
+import {
+  ALL_EDGE_TYPES,
+  NULL_EDGE_TYPE,
+  type NullEdgeType,
+  type AllEdgeTypes,
+} from './Graph';
 import type {NodeId} from './types';
 
 /** The address of the node in the nodes map. */
@@ -116,7 +121,7 @@ const MAX_LINK_TRIES: 3 = 3;
  * `getInboundEdgesByType` methods.
  *
  */
-export default class AdjacencyList<TEdgeType: number = 1> {
+export default class AdjacencyList<TEdgeType: number = NullEdgeType> {
   #nodes: NodeTypeMap<TEdgeType | NullEdgeType>;
   #edges: EdgeTypeMap<TEdgeType | NullEdgeType>;
 
@@ -363,7 +368,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
   addEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType = 1,
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ): boolean {
     assert(from < this.#nodes.nextId, `Node ${from} does not exist.`);
     assert(to < this.#nodes.nextId, `Node ${to} does not exist.`);
@@ -433,7 +438,10 @@ export default class AdjacencyList<TEdgeType: number = 1> {
   hasEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> = 1,
+    type:
+      | TEdgeType
+      | NullEdgeType
+      | Array<TEdgeType | NullEdgeType> = NULL_EDGE_TYPE,
   ): boolean {
     let hasEdge = (type: TEdgeType | NullEdgeType) => {
       let hash = this.#edges.hash(from, to, type);
@@ -458,7 +466,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
   removeEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType = 1,
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ): void {
     let hash = this.#edges.hash(from, to, type);
     let edge = this.#edges.addressOf(hash, from, to, type);
@@ -568,7 +576,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
       | AllEdgeTypes
       | TEdgeType
       | NullEdgeType
-      | Array<TEdgeType | NullEdgeType> = 1,
+      | Array<TEdgeType | NullEdgeType> = NULL_EDGE_TYPE,
   ): NodeId[] {
     let matches = (node) =>
       type === ALL_EDGE_TYPES ||
@@ -622,7 +630,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
   forEachNodeIdConnectedTo(
     to: NodeId,
     fn: (nodeId: NodeId) => boolean | void,
-    type: AllEdgeTypes | TEdgeType | NullEdgeType = 1,
+    type: AllEdgeTypes | TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ) {
     const matches = (node) =>
       type === ALL_EDGE_TYPES || type === this.#nodes.typeOf(node);
@@ -656,7 +664,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
       | AllEdgeTypes
       | TEdgeType
       | NullEdgeType
-      | Array<TEdgeType | NullEdgeType> = 1,
+      | Array<TEdgeType | NullEdgeType> = NULL_EDGE_TYPE,
   ): NodeId[] {
     let matches = (node) =>
       type === ALL_EDGE_TYPES ||

package/src/ContentGraph.js

@@ -75,6 +75,13 @@ export default class ContentGraph<TNode, TEdgeType: number = 1> extends Graph<
     }
   }
 
+  getContentKeyByNodeId(nodeId: NodeId): ContentKey {
+    return nullthrows(
+      this._nodeIdToContentKey.get(nodeId),
+      `Expected node id ${nodeId} to exist`,
+    );
+  }
+
   getNodeIdByContentKey(contentKey: ContentKey): NodeId {
     return nullthrows(
       this._contentKeyToNodeId.get(contentKey),

package/src/Graph.js

@@ -13,14 +13,15 @@ import {BitSet} from './BitSet';
 import nullthrows from 'nullthrows';
 
 export type NullEdgeType = 1;
-export type GraphOpts<TNode, TEdgeType: number = 1> = {|
+export const NULL_EDGE_TYPE: NullEdgeType = 1;
+export type GraphOpts<TNode, TEdgeType: number = NullEdgeType> = {|
   nodes?: Array<TNode | null>,
   adjacencyList?: SerializedAdjacencyList<TEdgeType>,
   rootNodeId?: ?NodeId,
   initialCapacity?: number,
 |};
 
-export type SerializedGraph<TNode, TEdgeType: number = 1> = {|
+export type SerializedGraph<TNode, TEdgeType: number = NullEdgeType> = {|
   nodes: Array<TNode | null>,
   adjacencyList: SerializedAdjacencyList<TEdgeType>,
   rootNodeId: ?NodeId,
@@ -74,7 +75,7 @@ export type DFSParams<TContext> = {|
   startNodeId?: ?NodeId,
 |};
 
-export default class Graph<TNode, TEdgeType: number = 1> {
+export default class Graph<TNode, TEdgeType: number = NullEdgeType> {
   nodes: Array<TNode | null>;
   adjacencyList: AdjacencyList<TEdgeType>;
   rootNodeId: ?NodeId;
@@ -138,7 +139,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   addEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType = 1,
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ): boolean {
     if (Number(type) === 0) {
       throw new Error(`Edge type "${type}" not allowed`);
@@ -158,7 +159,10 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   hasEdge(
     from: NodeId,
     to: NodeId,
-    type?: TEdgeType | NullEdgeType | Array<TEdgeType | NullEdgeType> = 1,
+    type?:
+      | TEdgeType
+      | NullEdgeType
+      | Array<TEdgeType | NullEdgeType> = NULL_EDGE_TYPE,
   ): boolean {
     return this.adjacencyList.hasEdge(from, to, type);
   }
@@ -166,7 +170,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   forEachNodeIdConnectedTo(
     to: NodeId,
     fn: (nodeId: NodeId) => boolean | void,
-    type: AllEdgeTypes | TEdgeType | NullEdgeType = ALL_EDGE_TYPES,
+    type: AllEdgeTypes | TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ) {
     this._assertHasNodeId(to);
 
@@ -176,7 +180,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   forEachNodeIdConnectedFrom(
     from: NodeId,
     fn: (nodeId: NodeId) => void,
-    type: AllEdgeTypes | TEdgeType | NullEdgeType = ALL_EDGE_TYPES,
+    type: AllEdgeTypes | TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
   ) {
     this._assertHasNodeId(from);
 
@@ -196,7 +200,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
-      | AllEdgeTypes = 1,
+      | AllEdgeTypes = NULL_EDGE_TYPE,
   ): Array<NodeId> {
     this._assertHasNodeId(nodeId);
 
@@ -209,7 +213,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
-      | AllEdgeTypes = 1,
+      | AllEdgeTypes = NULL_EDGE_TYPE,
   ): Array<NodeId> {
     this._assertHasNodeId(nodeId);
 
@@ -240,7 +244,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     this.nodes[nodeId] = null;
   }
 
-  removeEdges(nodeId: NodeId, type: TEdgeType | NullEdgeType = 1) {
+  removeEdges(nodeId: NodeId, type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE) {
     if (!this.hasNode(nodeId)) {
       return;
     }
@@ -253,7 +257,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   removeEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType = 1,
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
     removeOrphans: boolean = true,
   ) {
     if (!this.adjacencyList.hasEdge(from, to, type)) {
@@ -269,7 +273,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   _removeEdge(
     from: NodeId,
     to: NodeId,
-    type: TEdgeType | NullEdgeType = 1,
+    type: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
     removeOrphans: boolean = true,
   ) {
     if (!this.adjacencyList.hasEdge(from, to, type)) {
@@ -325,7 +329,8 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     fromNodeId: NodeId,
     toNodeIds: $ReadOnlyArray<NodeId>,
     replaceFilter?: null | ((NodeId) => boolean),
-    type?: TEdgeType | NullEdgeType = 1,
+    type?: TEdgeType | NullEdgeType = NULL_EDGE_TYPE,
+    removeOrphans: boolean = true,
   ): void {
     this._assertHasNodeId(fromNodeId);
 
@@ -344,7 +349,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     }
 
     for (let child of childrenToRemove) {
-      this._removeEdge(fromNodeId, child, type);
+      this._removeEdge(fromNodeId, child, type, removeOrphans);
     }
   }
 
@@ -355,7 +360,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
-      | AllEdgeTypes = 1,
+      | AllEdgeTypes = NULL_EDGE_TYPE,
   ): ?TContext {
     let enter = typeof visit === 'function' ? visit : visit.enter;
     if (
@@ -389,7 +394,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       | TEdgeType
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType>
-      | AllEdgeTypes = 1,
+      | AllEdgeTypes = NULL_EDGE_TYPE,
   ): ?TContext {
     return this.dfs({
       visit,

package/test/ContentGraph.test.js

@@ -39,4 +39,22 @@ describe('ContentGraph', () => {
 
     assert(!graph.hasContentKey('contentKey'));
   });
+
+  describe('getContentKeyByNodeId', () => {
+    it('returns the content key for a node', () => {
+      const graph = new ContentGraph();
+
+      const node1 = graph.addNodeByContentKey('node1', {});
+      assert.equal(graph.getContentKeyByNodeId(node1), 'node1');
+      const node2 = graph.addNodeByContentKey('node2', {});
+      assert.equal(graph.getContentKeyByNodeId(node2), 'node2');
+    });
+
+    it('throws if the node does not have a content key', () => {
+      const graph = new ContentGraph();
+
+      const node1 = graph.addNode({});
+      assert.throws(() => graph.getContentKeyByNodeId(node1));
+    });
+  });
 });

package/test/Graph.test.js

@@ -37,13 +37,6 @@ describe('Graph', () => {
     }, /Does not have node/);
   });
 
-  it("errors if replaceNodeIdsConnectedTo is called with a node that doesn't belong", () => {
-    let graph = new Graph();
-    assert.throws(() => {
-      graph.replaceNodeIdsConnectedTo(toNodeId(-1), []);
-    }, /Does not have node/);
-  });
-
   it("errors when adding an edge to a node that doesn't exist", () => {
     let graph = new Graph();
     let node = graph.addNode({});
@@ -274,26 +267,63 @@ describe('Graph', () => {
     }
   });
 
-  it("replaceNodeIdsConnectedTo should update a node's downstream nodes", () => {
-    let graph = new Graph();
-    let nodeA = graph.addNode('a');
-    graph.setRootNodeId(nodeA);
-    let nodeB = graph.addNode('b');
-    let nodeC = graph.addNode('c');
-    graph.addEdge(nodeA, nodeB);
-    graph.addEdge(nodeA, nodeC);
+  describe('replaceNodeIdsConnectedTo', () => {
+    it("errors if replaceNodeIdsConnectedTo is called with a node that doesn't belong", () => {
+      let graph = new Graph();
+      assert.throws(() => {
+        graph.replaceNodeIdsConnectedTo(toNodeId(-1), []);
+      }, /Does not have node/);
+    });
 
-    let nodeD = graph.addNode('d');
-    graph.replaceNodeIdsConnectedTo(nodeA, [nodeB, nodeD]);
+    it("replaceNodeIdsConnectedTo should update a node's downstream nodes", () => {
+      let graph = new Graph();
+      let nodeA = graph.addNode('a');
+      graph.setRootNodeId(nodeA);
+      let nodeB = graph.addNode('b');
+      let nodeC = graph.addNode('c');
+      graph.addEdge(nodeA, nodeB);
+      graph.addEdge(nodeA, nodeC);
+
+      let nodeD = graph.addNode('d');
+      graph.replaceNodeIdsConnectedTo(nodeA, [nodeB, nodeD]);
+
+      assert(graph.hasNode(nodeA));
+      assert(graph.hasNode(nodeB));
+      assert(!graph.hasNode(nodeC)); // orphan removed
+      assert(graph.hasNode(nodeD));
+      assert.deepEqual(Array.from(graph.getAllEdges()), [
+        {from: nodeA, to: nodeB, type: 1},
+        {from: nodeA, to: nodeD, type: 1},
+      ]);
+    });
 
-    assert(graph.hasNode(nodeA));
-    assert(graph.hasNode(nodeB));
-    assert(!graph.hasNode(nodeC));
-    assert(graph.hasNode(nodeD));
-    assert.deepEqual(Array.from(graph.getAllEdges()), [
-      {from: nodeA, to: nodeB, type: 1},
-      {from: nodeA, to: nodeD, type: 1},
-    ]);
+    it('replaceNodeIdsConnectedTo does not remove orphan nodes if flag is false', () => {
+      let graph = new Graph();
+      let nodeA = graph.addNode('a');
+      graph.setRootNodeId(nodeA);
+      let nodeB = graph.addNode('b');
+      let nodeC = graph.addNode('c');
+      graph.addEdge(nodeA, nodeB);
+      graph.addEdge(nodeA, nodeC);
+
+      let nodeD = graph.addNode('d');
+      graph.replaceNodeIdsConnectedTo(
+        nodeA,
+        [nodeB, nodeD],
+        () => true,
+        1,
+        false,
+      );
+
+      assert(graph.hasNode(nodeA));
+      assert(graph.hasNode(nodeB));
+      assert(graph.hasNode(nodeC)); // orphan kept
+      assert(graph.hasNode(nodeD));
+      assert.deepEqual(Array.from(graph.getAllEdges()), [
+        {from: nodeA, to: nodeB, type: 1},
+        {from: nodeA, to: nodeD, type: 1},
+      ]);
+    });
   });
 
   it('traverses along edge types if a filter is given', () => {

package/LICENSE

@@ -1,201 +0,0 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright (c) 2024 Atlassian US., Inc.
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.