Update search.ipynb (#359)

ed-word · norvig · commit c5c964e9363f · 2017-03-18T01:06:45.000-07:00
diff --git a/search.ipynb b/search.ipynb
@@ -273,7 +273,7 @@
     "initial_node_colors = dict(node_colors)\n",
     "    \n",
     "# positions for node labels\n",
-    "node_label_pos = {k:[v[0],v[1]-10] for k,v in romania_locations.items()}\n",
+    "node_label_pos = { k:[v[0],v[1]-10]  for k,v in romania_locations.items() }\n",
     "\n",
     "# use this while labeling edges\n",
     "edge_labels = dict()\n",
@@ -283,6 +283,7 @@
     "    connections = romania_map.get(node)\n",
     "    for connection in connections.keys():\n",
     "        distance = connections[connection]\n",
+    "\n",
     "        # add edges to the graph\n",
     "        G.add_edge(node, connection)\n",
     "        # add distances to edge_labels\n",
@@ -293,7 +294,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "We have completed building our graph based on romania_map and its locations. It's time to display it here in the notebook. This function `show_map(node_colors)` helps us do that. We will be calling this function later on to display the map at each and every interval step while searching using variety of algorithms from the book."
+    "We have completed building our graph based on romania_map and its locations. It's time to display it here in the notebook. This function `show_map(node_colors)` helps us do that. We will be calling this function later on to display the map at each and every interval step while searching, using variety of algorithms from the book."
    ]
   },
   {
@@ -438,7 +439,7 @@
     "                \n",
     "                for i in range(slider.max + 1):\n",
     "                    slider.value = i\n",
-    "    #                 time.sleep(.5)\n",
+    "                     #time.sleep(.5)\n",
     "        \n",
     "        slider = widgets.IntSlider(min=0, max=1, step=1, value=0)\n",
     "        slider_visual = widgets.interactive(slider_callback, iteration = slider)\n",
@@ -530,13 +531,15 @@
     "    all_node_colors = []\n",
     "    node_colors = dict(initial_node_colors)\n",
     "    \n",
+    "    #Adding first node to the queue\n",
     "    frontier.append(Node(problem.initial))\n",
     "    \n",
     "    node_colors[Node(problem.initial).state] = \"orange\"\n",
     "    iterations += 1\n",
     "    all_node_colors.append(dict(node_colors))\n",
     "    \n",
     "    while frontier:\n",
+    "        #Popping first node of queue\n",
     "        node = frontier.pop()\n",
     "        \n",
     "        # modify the currently searching node to red\n",
