multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-14 00:27:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update test.js

Browse Source
This commit is contained in:
multipleof4
2025-10-14 05:11:32 -07:00
committed by GitHub
parent 9184681d5b
commit 70d0bf27e6
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
tests/1_dijkstra/test.js
View File

@@ -2,7 +2,7 @@ export default {
functionName: 'findShortestPath', functionName: 'findShortestPath',
prompt: `// Write an async JavaScript function 'findShortestPath' that finds the shortest path in a weighted, undirected graph using Dijkstra's algorithm. 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. // - 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. // - 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. // - 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': { ... }, ... }`, // - Graph format: { 'A': { 'B': 1, 'C': 4 }, 'B': { ... }, ... }`,
runTest: async (findShortestPath) => { runTest: async (findShortestPath) => {