From 7f55b7aa6e072dec3150af79f447afb4bbc5f205 Mon Sep 17 00:00:00 2001
From: multipleof4 <planetrenox@protonmail.com>
Date: Mon, 13 Oct 2025 05:50:40 -0700
Subject: [PATCH] Feat: Reorganizing tests into subdirectories

---
 tests/1_dijkstra/test.js | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 tests/1_dijkstra/test.js

diff --git a/tests/1_dijkstra/test.js b/tests/1_dijkstra/test.js
new file mode 100644
index 0000000..b9feb01
--- /dev/null
+++ b/tests/1_dijkstra/test.js
@@ -0,0 +1,32 @@
+module.exports = {
+  prompt: `
+// Write an async JavaScript function 'findShortestPath' that finds the shortest path in a weighted, undirected graph using Dijkstra's algorithm.
+// - The function must accept a graph, a start node, and an end node.
+// - You MUST use a dynamic import() to load the 'js-priority-queue' library from a CDN (e.g., jsdelivr) for the priority queue.
+// - The function should return the total weight of the shortest path, or Infinity if no path exists.
+// - Graph format: { 'A': { 'B': 1, 'C': 4 }, 'B': { ... }, ... }
+`,
+  harness: `
+const assert = require('assert');
+async function runTest() {
+  const graph = {
+    A: { B: 2, C: 5 },
+    B: { A: 2, C: 6, D: 1, E: 3 },
+    C: { A: 5, B: 6, F: 8 },
+    D: { B: 1, E: 4 },
+    E: { B: 3, D: 4, F: 2 },
+    F: { C: 8, E: 2 }
+  };
+  try {
+    const dist = await findShortestPath(graph, 'A', 'F');
+    assert.strictEqual(dist, 7, "Test Failed: Path A to F should be 7.");
+    console.log("Test Passed!");
+    process.exit(0);
+  } catch (e) {
+    console.error("Test Execution Error:", e.message);
+    process.exit(1);
+  }
+}
+runTest();
+`
+};