     "metadata": {},
     "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"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
 
</s>
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
     "metadata": {},
     "source": [
      "## Constraints\n",
      "\n",
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
    "* Is the graph directed?\n",
    "    * Yes\n",
    "* Do the edges have weights?\n",
    "    * Yes"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
keep keep keep keep replace replace replace replace replace replace keep keep keep keep keep
 Revised constraints and algorithm.  Added comment denoting key/value for each dictionary in the code section.
graphs_trees/graph/graph_solution.ipynb