multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-13 16:17:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revert: Update test.js

Browse Source
This commit is contained in:
multipleof4
2025-11-13 16:48:59 -08:00
parent d6a8afab90
commit f2e9b766dc
1 changed files with 7 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
tests/1_dijkstra/test.js
View File

@@ -5,19 +5,17 @@ export default {
// - You MUST use a dynamic import() to load the 'js-priority-queue' library from a CDN 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': { ... }, ... }`,
getTestCases: () => {
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 }
};
return [graph, 'A', 'F'];
},
runTest: async (findShortestPath) => {
const assert = {
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },
};
const [graph, start, end] = globalThis.getTestCases ? globalThis.getTestCases() : this.getTestCases();
const dist = await findShortestPath(graph, start, end);
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 }
};
const dist = await findShortestPath(graph, 'A', 'F');
assert.strictEqual(dist, 7, "Test Failed: Path A to F should be 7.");
}
};