Refactor: Use shared prompt from README config

This commit is contained in:
2025-10-13 10:57:46 -07:00
parent a2375eb537
commit ac4d26a964

View File

@@ -1,14 +1,10 @@
export default { export default {
functionName: 'findShortestPath', functionName: 'findShortestPath',
prompt: ` prompt: `// Write an async JavaScript function 'findShortestPath' that finds the shortest path in a weighted, undirected graph using Dijkstra's algorithm.
// Your goal is to write a production-ready and maintainable JavaScript function. Apply code-golfing practices without sacrificing readability by putting everything on one line. Do not include any comments in your code.
//
// 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 (e.g., jsdelivr) 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) => {
const assert = { const assert = {
strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) }, strictEqual: (a, e, m) => { if (a !== e) throw new Error(m || `FAIL: ${a} !== ${e}`) },