Revised constraints and algorithm. Added comment denoting key/value for each dictionary in the code section.

2026-01-14 05:18:02 +00:00 · 2015-08-04 08:09:16 -04:00
parent 91dc014573
commit 9dc4116256
6 changed files with 349 additions and 16 deletions
--- a/graphs_trees/graph/graph_challenge.ipynb
+++ b/graphs_trees/graph/graph_challenge.ipynb
@@ -34,12 +34,10 @@
   "source": [
    "## Constraints\n",
    "\n",
-    "* I plan to use a Node and Graph class.  \n",
-    "    * Node will keep track of its id, visit state, and connections.  \n",
-    "        * Connections will be a dictionary with the key = node id and value being the edge weight\n",
-    "    * Graph will hold all of the nodes and have functions to add nodes and edges.  \n",
-    "    * Is this in line with what you have in mind?\n",
-    "        * Yes"
+    "* Is the graph directed?\n",
+    "    * Yes\n",
+    "* Do the edges have weights?\n",
+    "    * Yes"
   ]
  },
  {