Created
April 23, 2024 11:57
-
-
Save maehrm/d287101ab856427f3f8a410cad638d48 to your computer and use it in GitHub Desktop.
令和6年度春期応用技術者試験_午後_問3
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def distance(): | |
N = 5 # ノードの個数 | |
INF = float("inf") # 十分大きい定数 | |
# edge[m, n]には、ノードmからノードnへの距離を格納 | |
# 二つのノードが隣接していない場合には INF を格納 | |
edge = [ | |
[INF, 10, 16, INF, INF], | |
[10, INF, 4, 3, INF], | |
[16, 4, INF, 2, 3], | |
[INF, 3, 2, INF, 6], | |
[INF, INF, 3, 6, INF], | |
] | |
GOAL = N - 1 # 終点のノード番号 | |
dist = [INF] * N # 始点ノード距離。初期値はINF。 | |
done = [0] * N # 採点距離が確定したら1を入れる。 | |
viaNode = [-1] * N # 最短経路のノード番号を格納する | |
dist[0] = 0 | |
while True: | |
minDist = INF | |
for k in range(N): | |
if done[k] == 0 and minDist > dist[k]: | |
minDist = dist[k] | |
curNode = k | |
done[curNode] = 1 | |
if curNode == GOAL: | |
j = GOAL # 終点のノード番号 | |
print(GOAL) # 終点のノード番号の出力 | |
while j > 0: # 最短経路の出力 | |
print(viaNode[j]) | |
j = viaNode[j] | |
return dist[curNode] | |
for k in range(N): | |
if dist[curNode] + edge[curNode][k] < dist[k] and done[k] == 0: | |
dist[k] = dist[curNode] + edge[curNode][k] | |
viaNode[k] = curNode | |
print(distance()) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment