bmssp 0.11.0 → 0.13.0

package/README.md

@@ -29,20 +29,31 @@ To use this package, you can import it in your JavaScript code as follows:
 
 ```javascript
 // This is a WIP example
-import { printMessage, processMessage } from "bmssp";
+import { BMSSP } from "bmssp";
 
-printMessage("Hello, World!");
-processMessage("Hello, World!");
+const myBMSSP = new BMSSP([
+  [0, 1, 50],
+  [1, 2, 75],
+  [0, 2, 25],
+]);
+
+console.log(myBMSSP.graph);
 ```
 
 The file must use ECMAScript modules (ESM) syntax and have the `.mjs` file extension. Go to the `examples` directory for more usage examples.
 
 ### Using the docker image
 
-You can also use the published docker image and run your tests (assuming a `mytest.mjs` in this example) in a pre-configured environment:
+You can also use the published docker image and run the example:
+
+```bash
+docker run -it sirivasv/bmssp-js:latest
+```
+
+Or your tests in a pre-configured environment (replace `folder-mytest/` with your tests folder and `index.mjs` with your test file):
 
 ```bash
-docker run -it -v ./mytest.mjs:/bmssp-js/mytest.mjs sirivasv/bmssp-js:latest node /bmssp-js/mytest.mjs
+docker run -it -v ./folder-mytest/:/bmssp-js/folder-mytest/ sirivasv/bmssp-js:latest node /bmssp-js/folder-mytest/index.mjs
 ```
 
 Other versions of the docker image can be found on [Docker Hub](https://hub.docker.com/r/sirivasv/bmssp-js/tags).

package/index.mjs

@@ -1 +1 @@
-export { printMessage, processMessage } from "./src/bmssp.mjs";
+export { BMSSP } from "./src/bmssp.mjs";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bmssp",
-  "version": "0.11.0",
+  "version": "0.13.0",
   "description": "Javascript package implementation of the bmssp algorithm.",
   "main": "index.mjs",
   "keywords": [

package/src/bmssp.mjs

@@ -1,9 +1,46 @@
-function printMessage(message) {
-  return message;
-}
+class BMSSP {
+  constructor(inputGraph) {
+    // Main graph represented as an array of edges
+    this.graph = [];
+    // Set to store unique node IDs
+    this.nodeIDs = new Set();
+    // Map to store shortest paths
+    this.shortestPaths = new Map();
+
+    for (let edge of inputGraph) {
+      // Create a deep copy of each edge array
+      this.graph.push([...edge]);
+
+      // Add node IDs to the set
+      this.nodeIDs.add(edge[0]);
+      this.nodeIDs.add(edge[1]);
+    }
+
+    // Initialize shortest paths map
+    this.initializeShortestPaths();
+  }
+
+  // Method to initialize the shortest paths map
+  initializeShortestPaths() {
+    for (let nodeId of this.nodeIDs) {
+      this.shortestPaths.set(nodeId, Infinity);
+    }
+  }
+
+  // Method to calculate shortest paths (placeholder implementation)
+  calculateShortestPaths(startNode) {
+    // To clean the state before calculation
+    this.initializeShortestPaths();
+
+    // validate startNode
+    if (!this.nodeIDs.has(startNode)) {
+      throw new Error("Start node not found in the graph");
+    }
 
-function processMessage(message) {
-  return `Processed: ${message}`;
+    // Placeholder logic for shortest path calculation
+    // This should be replaced with an actual implementation of BMSSP algorithm
+    this.shortestPaths.set(startNode, 0);
+  }
 }
 
-export { printMessage, processMessage };
+export { BMSSP };