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

{"id":701597,"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 breadthFirstSearch(graph, startNode, targetNode) {\\r\\n  const queue = [startNode]; // 創建一個佇列，起始節點作為初始項目\\r\\n  const visited = new Set(); // 創建一個集合，用於記錄已訪問的節點\\r\\n  while (queue.length \u003e 0) { // 當佇列不為空時繼續搜索\\r\\n    const currentNode = queue.shift(); // 從佇列中取出下一個待處理節點\\r\\n    if (currentNode === targetNode) { // 檢查當前節點是否為目標節點\\r\\n      console.log(`目標節點 ${targetNode} 找到了！`); // 若找到目標節點，輸出訊息並結束搜尋\\r\\n      return;\\r\\n    }\\r\\n    visited.add(currentNode); // 將當前節點標記為已訪問\\r\\n    const neighbors = graph[currentNode]; // 取得當前節點的鄰居節點列表\\r\\n    for (let i = 0; i \u003c neighbors.length; i++) { // 遍歷當前節點的鄰居\\r\\n      const neighbor = neighbors[i]; // 取出一個鄰居節點\\r\\n      if (!visited.has(neighbor)) { // 如果鄰居節點尚未被訪問過\\r\\n        queue.push(neighbor); // 將鄰居節點加入佇列（表示待處理）\\r\\n        visited.add(neighbor); // 標記鄰居節點為已訪問\\r\\n      }\\r\\n    }\\r\\n  }\\r\\n  console.log(`目標節點 ${targetNode} 未找到！`); // 在搜尋結束後仍未找到目標節點，輸出訊息\\r\\n}\\r\\n\\r\\nconst graph = {\\r\\n  A: ['B', 'C'],\\r\\n  B: ['A', 'D'],\\r\\n  C: ['A', 'E'],\\r\\n  D: ['B', 'E', 'F'],\\r\\n  E: ['C', 'D', 'F'],\\r\\n  F: ['D', 'E']\\r\\n};\\r\\n\\r\\nbreadthFirstSearch(graph, 'A', 'F');\"}","created_at":"2024-02-26T15:11:19.195+08:00","updated_at":"2024-02-26T15:14:05.802+08:00","name":"【綜合練習】路徑搜尋：實作 1 - 問題 副本","language":"web","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/701597/30beb981ba33b784c68afee0ad4ccbb0.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":91,"hashid":"zpesz6v9k","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}