@mishieck/graph-js 0.2.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 mishieck
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,15 @@
+# graph-js
+
+To install dependencies:
+
+```bash
+bun install
+```
+
+To run:
+
+```bash
+bun run 
+```
+
+This project was created using `bun init` in bun v1.3.14. [Bun](https://bun.com) is a fast all-in-one JavaScript runtime.

package/dist/main.d.ts

@@ -0,0 +1,65 @@
+// Generated by dts-bundle-generator v9.5.1
+
+export declare enum GraphTraversal {
+	BreadthFirst = 0,
+	DepthFirst = 1
+}
+export type GraphNodeData<Data> = {
+	data: Data;
+	neighbors: Array<GraphNode<Data>>;
+};
+export declare class GraphNode<Data> {
+	data: Data;
+	neighbors: Array<GraphNode<Data>>;
+	constructor({ data, neighbors }: GraphNodeData<Data>);
+	setNeighbors(neighbors: Array<GraphNode<Data>>): void;
+	replaceNeighborAt(index: number, neighbor: GraphNode<Data>): void;
+	getNeighborAt(index: number): GraphNode<Data> | undefined;
+	get firstNeighbor(): GraphNode<Data> | null;
+	get lastNeighbor(): GraphNode<Data> | null;
+	traverse(traversal: GraphTraversal): IterableIterator<GraphNode<Data>>;
+	/**
+	 * Traverses the graph using breadth-first search. It uses a queue to handle
+	 * traversal.
+	 */
+	traverseBreadthFirst(): IterableIterator<GraphNode<Data>>;
+	/**
+	 * Traverses the graph using depth-first search. It uses a stack to handle
+	 * traversal.
+	 */
+	traverseDepthFirst(): IterableIterator<GraphNode<Data>>;
+}
+export type ChainNodeData<Data> = Pick<GraphNode<Data>, "data"> & {
+	data: Data;
+	previous: ChainNode<Data> | null;
+	next: ChainNode<Data> | null;
+};
+export declare class ChainNode<Data> extends GraphNode<Data> implements ChainNodeData<Data> {
+	constructor({ data, previous, next }: ChainNodeData<Data>);
+	get previous(): ChainNode<Data> | null;
+	set previous(previous: ChainNode<Data>);
+	get next(): ChainNode<Data> | null;
+	set next(next: ChainNode<Data>);
+}
+export type ListNodeData<Data> = Pick<GraphNode<Data>, "data"> & {
+	data: Data;
+	next: ListNode<Data> | null;
+};
+export declare class ListNode<Data> extends GraphNode<Data> implements ListNodeData<Data> {
+	constructor({ data, next }: ListNodeData<Data>);
+	get next(): ListNode<Data> | null;
+	set next(next: ListNode<Data>);
+}
+export type TreeNodeData<Data> = Pick<GraphNode<Data>, "data"> & {
+	parent: TreeNode<Data> | null;
+	children: Array<TreeNode<Data>>;
+};
+export declare class TreeNode<Data> extends GraphNode<Data> {
+	constructor({ data, parent, children }: TreeNodeData<Data>);
+	get parent(): TreeNode<Data> | null;
+	set parent(parent: TreeNode<Data>);
+	get children(): GraphNode<Data>[];
+	setChildren(children: Array<TreeNode<Data>>): void;
+}
+
+export {};

package/dist/main.js

@@ -0,0 +1,133 @@
+// lib/graph.ts
+var GraphTraversal;
+((GraphTraversal2) => {
+  GraphTraversal2[GraphTraversal2["BreadthFirst"] = 0] = "BreadthFirst";
+  GraphTraversal2[GraphTraversal2["DepthFirst"] = 1] = "DepthFirst";
+})(GraphTraversal ||= {});
+
+class GraphNode {
+  data;
+  neighbors;
+  constructor({ data, neighbors }) {
+    this.data = data;
+    this.neighbors = neighbors;
+  }
+  setNeighbors(neighbors) {
+    this.neighbors = neighbors;
+  }
+  replaceNeighborAt(index, neighbor) {
+    this.neighbors[index] = neighbor;
+  }
+  getNeighborAt(index) {
+    return this.neighbors.at(index);
+  }
+  get firstNeighbor() {
+    return this.getNeighborAt(0) ?? null;
+  }
+  get lastNeighbor() {
+    return this.getNeighborAt(-1) ?? null;
+  }
+  traverse(traversal) {
+    switch (traversal) {
+      case 0 /* BreadthFirst */:
+        return this.traverseBreadthFirst();
+      case 1 /* DepthFirst */:
+        return this.traverseDepthFirst();
+    }
+  }
+  traverseBreadthFirst() {
+    return function* ($this) {
+      const visited = new Set;
+      const nodes = [$this];
+      let node;
+      while (node = nodes.shift()) {
+        if (visited.has(node))
+          continue;
+        visited.add(node);
+        yield node;
+        nodes.push(...node.neighbors);
+      }
+    }(this);
+  }
+  traverseDepthFirst() {
+    return function* ($this) {
+      const neighborsAdded = new Set;
+      const visited = new Set;
+      const nodes = [$this];
+      let node;
+      while (node = nodes.at(-1)) {
+        const neighbors = [...node.neighbors];
+        if (!neighborsAdded.has(node) && neighbors.length) {
+          for (let i = neighbors.length - 1;i >= 0; i--) {
+            nodes.push(neighbors[i]);
+          }
+          neighborsAdded.add(node);
+        } else {
+          node = nodes.pop();
+          if (visited.has(node))
+            continue;
+          yield node;
+        }
+      }
+    }(this);
+  }
+}
+
+// lib/chain.ts
+class ChainNode extends GraphNode {
+  constructor({ data, previous, next }) {
+    super({ data, neighbors: [] });
+    super.setNeighbors([previous ?? this, next ?? this]);
+  }
+  get previous() {
+    return this.firstNeighbor === this ? null : this.firstNeighbor;
+  }
+  set previous(previous) {
+    super.replaceNeighborAt(0, previous);
+  }
+  get next() {
+    return this.lastNeighbor === this ? null : this.lastNeighbor;
+  }
+  set next(next) {
+    super.replaceNeighborAt(1, next);
+  }
+}
+// lib/list.ts
+class ListNode extends GraphNode {
+  constructor({ data, next }) {
+    super({ data, neighbors: [] });
+    super.setNeighbors([next ?? this]);
+  }
+  get next() {
+    return this.firstNeighbor === this ? null : this.firstNeighbor;
+  }
+  set next(next) {
+    super.replaceNeighborAt(0, next);
+  }
+}
+// lib/tree.ts
+class TreeNode extends GraphNode {
+  constructor({ data, parent, children }) {
+    super({ data, neighbors: [] });
+    this.neighbors = [parent ?? this, ...children];
+  }
+  get parent() {
+    return this.firstNeighbor === this ? null : this.firstNeighbor;
+  }
+  set parent(parent) {
+    super.replaceNeighborAt(0, parent);
+  }
+  get children() {
+    return this.neighbors.slice(1);
+  }
+  setChildren(children) {
+    super.setNeighbors([super.firstNeighbor, ...children]);
+  }
+}
+export {
+  TreeNode,
+  ListNode,
+  GraphTraversal,
+  GraphNode,
+  ChainNode
+};

package/package.json

@@ -0,0 +1,33 @@
+{
+  "name": "@mishieck/graph-js",
+  "version": "0.2.0",
+  "author": {
+    "name": "Mishieck Mwale",
+    "email": "mishieckdev@gmail.com",
+    "url": "https://mishieck.vercel.app"
+  },
+  "repository": {
+    "url": "https://github.com/mishieck/graph-js"
+  },
+  "devDependencies": {
+    "@types/bun": "latest",
+    "bun-plugin-dts": "^0.4.0"
+  },
+  "peerDependencies": {
+    "typescript": "^5"
+  },
+  "exports": {
+    "default": "./dist/main.js",
+    "types": "./dist/main.d.ts"
+  },
+  "description": "A TypeScript library for graph data structures.",
+  "files": ["dist"],
+  "keywords": ["graph", "tree", "linked-list", "graph-node", "data-structures", "data-structures-and-algorithms"],
+  "license": "MIT",
+  "scripts": {
+    "build": "bun build.ts",
+    "build:prod": "export NODE_ENV=production; bun build.ts",
+    "publish": "bun publish --access=public"
+  },
+  "type": "module"
+}