【綜合練習】路徑搜尋：實作 2 - 題目說明 | 程式專案

{"id":576416,"student_id":2589,"content":"{\"html\":\"\u003c!DOCTYPE html\u003e\\n\u003chtml\u003e\\n\u003chead\u003e\\n\\t\u003ctitle\u003eDocument\u003c/title\u003e\\n\u003c/head\u003e\\n\u003cbody\u003e\\n    \u003cdiv id=\\\"question\\\"\u003e\\n        \u003cp\u003e請依照以下步驟進行綜合練習：\u003c/p\u003e\\n        \u003cp\u003e1. 搭配過去學過的演算法知識（最佳優先搜尋），來閱讀練習頁面中的 JavaScript。\u003c/p\u003e\\n        \u003cp\u003e2. 修改練習頁面中的 JavaScript，讓執行後網頁上的顯示文字與下方相同。\u003c/p\u003e\\n    \u003c/div\u003e\\n    \u003cdiv id=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e題目：\u003c/p\u003e\\n        \u003cdiv id=\\\"log\\\"\u003eloading...\u003c/div\u003e\\n    \u003c/div\u003e\\n\u003c/body\u003e\\n\u003c/html\u003e\",\"css\":\"* {\\n    margin: 0;\\n    padding: 0;\\n    box-sizing: border-box;\\n    font-size: 16px;\\n}\\n\\nhtml, body {\\n    width: 100%;\\n    height: 100%;\\n    background-color: #333;\\n    padding: 10px;\\n}\\n\\np {\\n    color: white;\\n    margin-bottom: 10px;\\n}\\n\\n#log {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n}\\n\\n#code {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n    overflow-x: scroll;\\n}\\n\\n#question {\\n    height: 130px;\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\\n\\n#screenshot {\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\",\"js\":\"function bestFirstSearch(graph, start, goal) {\\n  const queue = [start];\\n  const visited = new Set();\\n  while (queue.length \u003e 0) {\\n    const current = queue.shift();\\n    console.log(`Visiting node: ${current}`);\\n    if (current === goal) {\\n      console.log(\\\"Goal node found!\\\");\\n      return;\\n    }\\n    visited.add(current);\\n    const neighbors = graph[current];\\n    neighbors.sort((a, b) =\u003e evaluateNode(a) - evaluateNode(b));\\n    for (const neighbor of neighbors) {\\n      if (!visited.has(neighbor) \u0026\u0026 !queue.includes(neighbor)) {\\n        queue.push(neighbor);\\n      }\\n    }\\n  }\\n  console.log(\\\"Goal node not found!\\\");\\n}\\n\\nfunction evaluateNode(node) {\\n  return node;\\n}\\n\\nconst graph = {\\n  A: [\\\"B\\\", \\\"C\\\"],\\n  B: [\\\"D\\\", \\\"E\\\"],\\n  C: [\\\"F\\\"],\\n  D: [],\\n  E: [],\\n  F: [],\\n};\\n\\nbestFirstSearch(graph, \\\"A\\\", \\\"D\\\");\\n\"}","created_at":"2023-07-28T11:18:19.821+08:00","updated_at":"2023-07-31T14:13:00.287+08:00","name":"【綜合練習】路徑搜尋：實作 2 - 題目說明","language":"web","screenshot":{"url":null},"parent_id":576415,"plugin":"(function () {\n    if (!console) {\n        console = {};\n    }\n    var old = console.log;\n    var logger = document.getElementById('log');\n    logger.innerHTML = \"\"\n    console.log = function (message) {\n        if (typeof message == 'object') {\n            logger.innerHTML += (JSON \u0026\u0026 JSON.stringify ? JSON.stringify(message) : String(message)) + '\u003cbr /\u003e';\n        } else {\n            logger.innerHTML += message + '\u003cbr /\u003e';\n        }\n    }\n})();\n","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":30,"hashid":"zpesrm3jk","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}