編集履歴

質問編集履歴

誤字

2018/12/16 07:07

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -184,7 +184,7 @@
 def find_lowest_cost_node(costs):
-    lowest_cost = float("inf")
+    lowest_cost = float("end")
     lowest_cost_node = None

文法の修正

2018/12/16 07:07

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -184,92 +184,92 @@
 def find_lowest_cost_node(costs):
+    lowest_cost = float("inf")
+    lowest_cost_node = None
+    # Go through each node.
+    for node in costs:
+        cost = costs[node]
+        # If it's the lowest cost so far and hasn't been processed yet...
+        if cost < lowest_cost and node not in processed:
+            # ... set it as the new lowest-cost node.
+            lowest_cost = cost
+            lowest_cost_node = node
+    return lowest_cost_node
+# Find the lowest-cost node that you haven't processed yet.
+node = find_lowest_cost_node(costs)
+# If you've processed all the nodes, this while loop is done.
+while node is not None:
+    cost = costs[node]
+    # Go through all the neighbors of this node.
+    neighbors = graph[node]
+    for n in neighbors.keys():
+        new_cost = cost + neighbors[n]
+        # If it's cheaper to get to this neighbor by going through this node...
+        if costs[n] > new_cost:
+            # ... update the cost for this node.
+            costs[n] = new_cost
+            # This node becomes the new parent for this neighbor.
+            parents[n] = node
+    # Mark the node as processed.
+    processed.append(node)
+    # Find the next node to process, and loop.
+    node = find_lowest_cost_node(costs)
+print "Cost from the start to each node:"
+print costs
+```
+### 発生している問題・エラーメッセージ
+```
+Traceback (most recent call last):
+  File "sample.py", line 76, in <module>
+    node = find_lowest_cost_node(costs)
+  File "sample.py", line 63, in find_lowest_cost_node
     lowest_cost = float("end")
-    lowest_cost_node = None
-    # Go through each node.
-    for node in costs:
-        cost = costs[node]
-        # If it's the lowest cost so far and hasn't been processed yet...
-        if cost < lowest_cost and node not in processed:
-            # ... set it as the new lowest-cost node.
-            lowest_cost = cost
-            lowest_cost_node = node
-    return lowest_cost_node
-# Find the lowest-cost node that you haven't processed yet.
-node = find_lowest_cost_node(costs)
-# If you've processed all the nodes, this while loop is done.
-while node is not None:
-    cost = costs[node]
-    # Go through all the neighbors of this node.
-    neighbors = graph[node]
-    for n in neighbors.keys():
-        new_cost = cost + neighbors[n]
-        # If it's cheaper to get to this neighbor by going through this node...
-        if costs[n] > new_cost:
-            # ... update the cost for this node.
-            costs[n] = new_cost
-            # This node becomes the new parent for this neighbor.
-            parents[n] = node
-    # Mark the node as processed.
-    processed.append(node)
-    # Find the next node to process, and loop.
-    node = find_lowest_cost_node(costs)
-print "Cost from the start to each node:"
-print costs
-```
-### 発生している問題・エラーメッセージ
-```
-Traceback (most recent call last):
-  File "sample.py", line 76, in <module>
-    node = find_lowest_cost_node(costs)
-  File "sample.py", line 63, in find_lowest_cost_node
-    lowest_cost = float("end")
 ValueError: could not convert string to float: end

書式の改善

2018/12/16 07:00

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -254,6 +254,28 @@
 ```
+### 発生している問題・エラーメッセージ
+```
+Traceback (most recent call last):
+  File "sample.py", line 76, in <module>
+    node = find_lowest_cost_node(costs)
+  File "sample.py", line 63, in find_lowest_cost_node
+    lowest_cost = float("end")
+ValueError: could not convert string to float: end
+```
 ### 試したこと

書式の改善

2018/12/16 06:55

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -271,5 +271,3 @@
 Ubuntu18.04
 python2.7
-python3.6.7

誤字

2018/12/16 06:34

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -4,7 +4,7 @@
 現在Pythonでプログラミングを学んでいるのですが幅優先探索で躓いてます。
-下記のようなグラフを作り具体例のような処理を行いたいですが上手く動作させることが出来ません。
+下記のようなグラフを作り具体例のような処理を行いたいのですが上手く動作させることが出来ません。
 どなたかご教授していただけると助かります。

書式の改善

2018/12/16 06:05

投稿

apollo.

スコア13

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -32,13 +32,13 @@
  8.dの隣接ノードの中で一番重みの小さいhに100移す。
- 9.eの隣接ノードで重みが一番小さいEnd nodeに350移す。
-10.fの隣接ノードで重みが一番小さいEnd nodeに150移す。
-11.gの隣接ノードの中で一番重みの小さいiに400移す。
+ 9.gの隣接ノードの中で一番重みの小さいiに400移す。
-12.hの隣接ノードの中で一番重みの小さいEnd nodeに100移す。
+10.hの隣接ノードの中で一番重みの小さいEnd nodeに100移す。
+11.eの隣接ノードで重みが一番小さいEnd nodeに350移す。
+12.fの隣接ノードで重みが一番小さいEnd nodeに150移す。
 13.iの隣接ノードで重みが一番小さいEnd nodeに400移す。