{"id":28075,"date":"2024-10-27T15:21:19","date_gmt":"2024-10-27T15:21:19","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=28075"},"modified":"2024-11-26T07:10:11","modified_gmt":"2024-11-26T07:10:11","slug":"%ec%9e%90%eb%b0%94%ec%8a%a4%ed%81%ac%eb%a6%bd%ed%8a%b8-%ec%bd%94%eb%94%a9%ed%85%8c%ec%8a%a4%ed%8a%b8-%ea%b0%95%ec%a2%8c-%ea%b0%80%ec%9e%a5-%eb%b9%a0%eb%a5%b8-%eb%b2%84%ec%8a%a4-%eb%85%b8%ec%84%a0","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/28075\/","title":{"rendered":"\uc790\ubc14\uc2a4\ud06c\ub9bd\ud2b8 \ucf54\ub529\ud14c\uc2a4\ud2b8 \uac15\uc88c, \uac00\uc7a5 \ube60\ub978 \ubc84\uc2a4 \ub178\uc120 \uad6c\ud558\uae30"},"content":{"rendered":"

<\/p>\n

\ubb38\uc81c \uc18c\uac1c<\/h2>\n

\ub2f9\uc2e0\uc740 A \uc9c0\uc810\uc5d0\uc11c B \uc9c0\uc810\uae4c\uc9c0 \uac00\ub294 \uac00\uc7a5 \ube60\ub978 \ubc84\uc2a4 \ub178\uc120\uc744 \ucc3e\ub294 \ud504\ub85c\uadf8\ub7a8\uc744 \uc791\uc131\ud574\uc57c \ud569\ub2c8\ub2e4. \uc5ec\ub7ec \uac1c\uc758 \ubc84\uc2a4 \ub178\uc120\uc774 \uc788\uace0 \uac01\uac01\uc758 \ub178\uc120\uc740 \uc815\ud574\uc9c4 \uc815\ub958\uc18c\ub97c \uc9c0\ub098\uba70, \uc815\ub958\uc18c \uac04\uc758 \uc774\ub3d9 \uc2dc\uac04\uc740 \ubaa8\ub450 \ub2e4\ub974\uac8c \uc124\uc815\ub418\uc5b4 \uc788\uc2b5\ub2c8\ub2e4. \ucd5c\uc885 \ubaa9\ud45c\ub294 \ud2b9\uc815\ud55c A \uc9c0\uc810\uc5d0\uc11c B \uc9c0\uc810\uae4c\uc9c0\uc758 \uac00\uc7a5 \ube60\ub978 \uacbd\ub85c\ub97c \ucc3e\uace0, \ud574\ub2f9 \uacbd\ub85c\uc758 \uc18c\uc694\uc2dc\uac04\uc744 \ubc18\ud658\ud558\ub294 \uac83\uc785\ub2c8\ub2e4.<\/p>\n

\ubb38\uc81c \uc124\uba85<\/h3>\n

\n \uc8fc\uc5b4\uc9c4 \ub178\uc120\uc740 \ub2e4\uc74c\uacfc \uac19\uc774 \ud45c\ud604\ub429\ub2c8\ub2e4. \uac01 \ub178\uc120\uc740 \uc815\ub958\uc18c \uac04\uc758 \uc774\ub3d9 \uc2dc\uac04\uc744 \uac00\uc9c0\uba70, \uc815\ub958\uc18c\ub294 \ub2e4\uc74c\uacfc \uac19\uc740 \ud615\ud0dc\ub85c \ud45c\ud604\ub429\ub2c8\ub2e4:\n <\/p>\n

\n        [\n            {busRoute: \"1\", stops: [{stop: \"A\", time: 0}, {stop: \"B\", time: 5}, {stop: \"C\", time: 10}]},\n            {busRoute: \"2\", stops: [{stop: \"A\", time: 0}, {stop: \"D\", time: 3}, {stop: \"B\", time: 8}]},\n            {busRoute: \"3\", stops: [{stop: \"B\", time: 0}, {stop: \"C\", time: 4}, {stop: \"E\", time: 6}]},\n            {busRoute: \"4\", stops: [{stop: \"D\", time: 0}, {stop: \"E\", time: 2}, {stop: \"B\", time: 7}]},\n        ]\n    <\/pre>\n
\uc785\ub825<\/h2>\n
\uccab \ubc88\uc9f8 \ub9e4\uac1c\ubcc0\uc218\ub85c\ub294 \ubc84\uc2a4 \ub178\uc120\uc758 \ubc30\uc5f4, \ub450 \ubc88\uc9f8 \ub9e4\uac1c\ubcc0\uc218\ub85c\ub294 A \uc9c0\uc810\uacfc B \uc9c0\uc810\uc774 \uc8fc\uc5b4\uc9d1\ub2c8\ub2e4.<\/p>\n
\ucd9c\ub825<\/h2>\n
\uac00\uc7a5 \ube60\ub978 \uacbd\ub85c\uc758 \uc18c\uc694 \uc2dc\uac04\uc744 \ucd9c\ub825\ud569\ub2c8\ub2e4. \uacbd\ub85c\uac00 \uc5c6\ub2e4\uba74 -1\uc744 \ucd9c\ub825\ud569\ub2c8\ub2e4.<\/p>\n
\uc608\uc81c<\/h2>\n
\n        \uc785\ub825: \n        const routes = [\n            {busRoute: \"1\", stops: [{stop: \"A\", time: 0}, {stop: \"B\", time: 5}, {stop: \"C\", time: 10}]},\n            {busRoute: \"2\", stops: [{stop: \"A\", time: 0}, {stop: \"D\", time: 3}, {stop: \"B\", time: 8}]},\n            {busRoute: \"3\", stops: [{stop: \"B\", time: 0}, {stop: \"C\", time: 4}, {stop: \"E\", time: 6}]},\n            {busRoute: \"4\", stops: [{stop: \"D\", time: 0}, {stop: \"E\", time: 2}, {stop: \"B\", time: 7}]},\n        ];\n        const start = \"A\";\n        const end = \"B\";\n\n        \ucd9c\ub825: \n        5\n    <\/pre>\n
\ud574\uacb0 \ubc29\ubc95<\/h2>\n
\uc774 \ubb38\uc81c\ub97c \ud574\uacb0\ud558\uae30 \uc704\ud574 \uc6b0\ub9ac\ub294 \uadf8\ub798\ud504 \ud0d0\uc0c9 \uc54c\uace0\ub9ac\uc998\uc744 \uc0ac\uc6a9\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \uc815\ub958\uc18c\ub294 \ub178\ub4dc\ub85c, \uc815\ub958\uc18c \uac04 \uc2dc\uac04\uc740 \uadf8 \ub178\ub4dc\ub4e4 \uac04\uc758 \uc5e3\uc9c0\uc758 \uac00\uc911\uce58\ub85c \ud45c\ud604\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4. \uc801\uc808\ud55c \uc54c\uace0\ub9ac\uc998\uc73c\ub85c\ub294 BFS(\ub108\ube44 \uc6b0\uc120 \ud0d0\uc0c9)\ub098 Dijkstra \uc54c\uace0\ub9ac\uc998\uc774 \uc788\uc2b5\ub2c8\ub2e4. \uc774 \ubb38\uc81c\uc5d0\uc11c\ub294 Dijkstra \uc54c\uace0\ub9ac\uc998\uc774 \ub354 \ud6a8\uacfc\uc801\uc785\ub2c8\ub2e4, \uc65c\ub0d0\ud558\uba74 \ubaa8\ub4e0 \uac04\uc120\uc758 \uac00\uc911\uce58\uac00 \ub2e4\ub97c \uc218 \uc788\uc5b4\uc11c \uac00\uc7a5 \uc9e7\uc740 \uacbd\ub85c\ub97c \ucc3e\uae30 \uc704\ud574 \ucd5c\uc801\ud654\ub41c \ubc29\ubc95\uc774 \ud544\uc694\ud558\uae30 \ub54c\ubb38\uc785\ub2c8\ub2e4.<\/p>\n
Dijkstra \uc54c\uace0\ub9ac\uc998 \uac1c\uc694<\/h3>\n
Dijkstra\ub294 \uac00\uc911\uce58\uac00 \uc788\ub294 \uadf8\ub798\ud504\uc5d0\uc11c \ucd5c\ub2e8 \uacbd\ub85c\ub97c \ucc3e\uae30 \uc704\ud55c \uc54c\uace0\ub9ac\uc998\uc73c\ub85c, \ud604\uc7ac \ub178\ub4dc\uc5d0\uc11c \uc778\uc811 \ub178\ub4dc\ub85c \uc774\ub3d9\ud560 \ub54c\uc758 \ube44\uc6a9\uc744 \uacc4\uc18d \uc5c5\ub370\uc774\ud2b8\ud558\uba74\uc11c \ucd5c\uc885 \ubaa9\ud45c \ub178\ub4dc\ub85c \uac00\ub294 \uacbd\ub85c\ub97c \ud0d0\uc0c9\ud569\ub2c8\ub2e4. \uc774\ub97c \uc704\ud574 \uc6b0\ub9ac\ub294 \uac01 \uc815\ub958\uc18c\uc640 \ube44\uc6a9\uc744 \uae30\ub85d\ud560 \uc218 \uc788\ub294 \uc6b0\uc120\uc21c\uc704 \ud050\ub97c \uc0ac\uc6a9\ud569\ub2c8\ub2e4.<\/p>\n
\ucf54\ub4dc \uad6c\ud604<\/h2>\n
\n        function getFastestBusRoute(routes, start, end) {\n            \/\/ Priority queue for processing the stops\n            const pq = new MinPriorityQueue();\n            const distances = {};\n            const parents = {};\n\n            \/\/ Initialize distances and priority queue\n            for (const route of routes) {\n                for (const stop of route.stops) {\n                    distances[stop.stop] = Infinity;\n                    parents[stop.stop] = null;\n                }\n            }\n\n            \/\/ Starting point\n            distances[start] = 0;\n            pq.enqueue(start, 0);\n\n            while (!pq.isEmpty()) {\n                const currentStop = pq.dequeue().element;\n\n                \/\/ If we reach the target stop, return the distance\n                if (currentStop === end) {\n                    return distances[currentStop];\n                }\n\n                for (const route of routes) {\n                    for (let i = 0; i < route.stops.length - 1; i++) {\n                        const stop1 = route.stops[i].stop;\n                        const stop2 = route.stops[i + 1].stop;\n                        const time = route.stops[i + 1].time - route.stops[i].time;\n\n                        if (stop1 === currentStop) {\n                            const newTime = distances[stop1] + time;\n                            if (newTime < distances[stop2]) {\n                                distances[stop2] = newTime;\n                                parents[stop2] = stop1;\n                                pq.enqueue(stop2, newTime);\n                            }\n                        }\n                    }\n                }\n            }\n            return -1; \/\/ If there's no path to the end\n        }\n\n        \/\/ Example usage\n        const routes = [\n            {busRoute: \"1\", stops: [{stop: \"A\", time: 0}, {stop: \"B\", time: 5}, {stop: \"C\", time: 10}]},\n            {busRoute: \"2\", stops: [{stop: \"A\", time: 0}, {stop: \"D\", time: 3}, {stop: \"B\", time: 8}]},\n            {busRoute: \"3\", stops: [{stop: \"B\", time: 0}, {stop: \"C\", time: 4}, {stop: \"E\", time: 6}]},\n            {busRoute: \"4\", stops: [{stop: \"D\", time: 0}, {stop: \"E\", time: 2}, {stop: \"B\", time: 7}]},\n        ];\n        const start = \"A\";\n        const end = \"B\";\n        console.log(getFastestBusRoute(routes, start, end)); \/\/ Output: 5\n    <\/pre>\n
\uacb0\ub860<\/h2>\n
\uc774\ubc88 \uac15\uc88c\uc5d0\uc11c\ub294 \uc8fc\uc5b4\uc9c4 \ubc84\uc2a4 \ub178\uc120 \uc815\ubcf4\ub97c \ubc14\ud0d5\uc73c\ub85c \uac00\uc7a5 \ube60\ub978 \uacbd\ub85c\ub97c \ucc3e\ub294 \uc54c\uace0\ub9ac\uc998 \ubb38\uc81c\ub97c \ud574\uacb0\ud558\ub294 \ubc29\ubc95\uc744 \ubc30\uc6e0\uc2b5\ub2c8\ub2e4. Dijkstra \uc54c\uace0\ub9ac\uc998\uc740 \uac00\uc911\uce58\uac00 \uc788\ub294 \uadf8\ub798\ud504\uc5d0\uc11c \ucd5c\ub2e8 \uacbd\ub85c\ub97c \ucc3e\uc544\uc8fc\ub294 \ub9e4\uc6b0 \uc720\uc6a9\ud55c \ubc29\ubc95\uc785\ub2c8\ub2e4. \uac01 \ub2e8\uacc4\uc5d0\uc11c \uc2e4\uc81c\ub85c \uc5b4\ub5bb\uac8c \ud0d0\uc0c9\uc744 \uc9c4\ud589\ud558\ub294\uc9c0 \uc774\ud574\ud558\uace0, \uc774\ub97c \ucf54\ub529\uc73c\ub85c \uad6c\ud604\ud558\ub294 \uacfc\uc815\uc5d0\uc11c \ub9ce\uc740 \ub3c4\uc6c0\uc774 \ub418\uc5c8\uae30\ub97c \ubc14\ub78d\ub2c8\ub2e4.<\/p>\n
\ucd94\uac00 \uc5f0\uc2b5 \ubb38\uc81c<\/h2>\n
\uc774\ubc88 \ubb38\uc81c\ub97c \ud1b5\ud574 Dijkstra \uc54c\uace0\ub9ac\uc998\uc744 \uc775\ud614\ub2e4\uba74, \ub2e4\uc74c\uacfc \uac19\uc740 \ubcc0\ud615 \ubb38\uc81c\ub4e4\ub3c4 \uc2dc\ub3c4\ud574 \ubcf4\uc138\uc694:<\/p>\n