From 315813b3be67f8decae7dd2f8534e4daf69d5d64 Mon Sep 17 00:00:00 2001 From: multipleof4 Date: Mon, 13 Oct 2025 06:22:35 -0700 Subject: [PATCH] Feat: Update prompt instructions for LLMs --- tests/1_dijkstra/test.js | 2 ++ 1 file changed, 2 insertions(+) diff --git a/tests/1_dijkstra/test.js b/tests/1_dijkstra/test.js index ccb926b..2b3cbf0 100644 --- a/tests/1_dijkstra/test.js +++ b/tests/1_dijkstra/test.js @@ -1,5 +1,7 @@ export default { prompt: ` +// 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. // - You MUST use a dynamic import() to load the 'js-priority-queue' library from a CDN (e.g., jsdelivr) for the priority queue.