【綜合練習】路徑搜尋：實作 2 - 問題副本 | 程式專案

{"id":701598,"student_id":1443,"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=\\\"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\":\"// 最佳優先搜尋演算法\\r\\nfunction bestFirstSearch(graph, start, goal) {\\r\\n  const queue = [start]; // 創建一個佇列，起始節點作為初始項目\\r\\n  const visited = new Set(); // 創建一個集合，用於記錄已訪問的節點\\r\\n  while (queue.length \u003e 0) { // 當佇列不為空時繼續搜索\\r\\n    const current = queue.shift(); // 從佇列中取出下一個待處理節點\\r\\n    console.log(`Visiting node: ${current}`); // 輸出正在訪問的節點\\r\\n    if (current === goal) { // 檢查當前節點是否為目標節點\\r\\n      console.log(\\\"Goal node found!\\\"); // 若找到目標節點，輸出訊息並結束搜尋\\r\\n      return;\\r\\n    }\\r\\n    visited.add(current); // 將當前節點標記為已訪問\\r\\n    const neighbors = graph[current]; // 取得當前節點的鄰居節點列表\\r\\n    neighbors.sort((a, b) =\u003e evaluateNode(a) - evaluateNode(b)); // 根據節點評估函式對鄰居節點進行排序\\r\\n    for (const neighbor of neighbors) { // 遍歷當前節點的鄰居\\r\\n      if (!visited.has(neighbor) \u0026\u0026 !queue.includes(neighbor)) { // 如果鄰居節點尚未被訪問過且不在佇列中\\r\\n        queue.push(neighbor); // 將鄰居節點加入佇列（表示待處理）\\r\\n      }\\r\\n    }\\r\\n  }\\r\\n  console.log(\\\"Goal node not found!\\\"); // 在搜尋結束後仍未找到目標節點，輸出訊息\\r\\n}\\r\\n\\r\\n// 節點評估函式\\r\\nfunction evaluateNode(node) {\\r\\n  return node; // 在此示例中，節點本身即為評估值\\r\\n}\\r\\n\\r\\n// 定義圖形的鄰接表\\r\\nconst graph = {\\r\\n  A: [\\\"B\\\", \\\"C\\\"],\\r\\n  B: [\\\"D\\\", \\\"E\\\"],\\r\\n  C: [\\\"F\\\"],\\r\\n  D: [],\\r\\n  E: [],\\r\\n  F: [],\\r\\n};\\r\\n\\r\\n// 呼叫最佳優先搜尋函式，從節點 'A' 尋找節點 'D'\\r\\nbestFirstSearch(graph, \\\"A\\\", \\\"D\\\");\"}","created_at":"2024-02-26T15:14:10.502+08:00","updated_at":"2024-02-26T15:14:34.997+08:00","name":"【綜合練習】路徑搜尋：實作 2 - 問題 副本","language":"web","screenshot":{"url":"https://cdn3.koding.school/uploads/project/screenshot/701598/7632fd648cba6e51dac696c658db3805.jpg"},"parent_id":576413,"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})();","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":49,"hashid":"9ygs5e6w9","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}