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

{"id":1170613,"student_id":90858,"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\":\"//  -- 說明 --  //\\n//  請想想看要如何調整程式碼才能結合這次上課的知識，\\n//  讓執行後網頁上的顯示文字與下方相同。\\n\\n//  -- 提示 --  //\\n//  if (currentNode === targetNode) {\\n//      console.log(`Target node ${targetNode} found!`);\\n//      return;\\n//  }\\n//  for (let i = 0; i \u003c neighbors.length; i++) {\\n//      const neighbor = neighbors[i];\\n//  }\\n//  while (queue.length \u003e 0) {\\n//      const currentNode = queue.shift();\\n//      visited.add(currentNode);\\n//      const neighbors = graph[currentNode];\\n//  }\\n//  if (!visited.has(neighbor)) {\\n//      queue.push(neighbor);\\n//      visited.add(neighbor);\\n//  }\\n\\nfunction breadthFirstSearch(graph, startNode, targetNode) {\\n  const queue = [startNode]; \\n  const visited = new Set(); \\n  while (queue.length \u003e 0) { \\n    const currentNode = queue.shift();\\n    if (currentNode === targetNode) { \\n      console.log(`目標節點 ${targetNode} 找到了！`); \\n      return;\\n    }\\n    visited.add(currentNode); \\n    const neighbors = graph[currentNode]; \\n    for (let i = 0; i \u003c neighbors.length; i++) { \\n      const neighbor = neighbors[i]; \\n      if (!visited.has(neighbor)) { \\n        queue.push(neighbor); \\n        visited.add(neighbor); \\n      }\\n    }\\n  }\\n  console.log(`目標節點 ${targetNode} 未找到！`); // 在搜尋結束後仍未找到目標節點，輸出訊息\\n}\\n\\nconst graph = {\\n  A: ['B', 'C'],\\n  B: ['A', 'D'],\\n  C: ['A', 'E'],\\n  D: ['B', 'E', 'F'],\\n  E: ['C', 'D', 'F'],\\n  F: ['D', 'E']\\n};\\n\\nbreadthFirstSearch(graph, 'A', 'F');\\n\"}","created_at":"2025-11-23T17:25:06.446+08:00","updated_at":"2025-11-23T17:36:09.648+08:00","name":"【綜合練習】路徑搜尋：實作 1 - 問題 副本","language":"web","screenshot":{"url":"https://cdn8.koding.school/uploads/project/screenshot/1170613/150c102e200ecc3b6cffd1e40d9d51b4.jpg"},"parent_id":576410,"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":1,"hashid":"wdks3vz8g","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}