      "    * key: node\n",
      "    * value: weight\n",
      "\n",
      "### Graph\n",
      "\n",
      "Graph will keep track of its:\n",
      "* nodes\n",
      "    * key: node id\n",
 
</s> remove     "    * Yes\n",
 </s> add     "    * Implement both\n", </s> remove     "    * Yes\n",
 </s> add     "    * Implement both\n",
    "#### add_neighhbor\n",
    "\n",
    "* Add the neighbor as a key and the weight as the value to `adjacent`\n",
    "\n",
    "Complexity:\n",
    "* Time: O(1)\n",
    "* Space: O(1)\n",
    "\n",
      "    * key: node\n",
      "    * value: weight\n",
      "\n",
    "#### add_neighhbor\n",
    "\n",
    "* Add the neighbor as a key and the weight as the value to `adjacent`\n",
    "\n",
    "Complexity:\n",
    "* Time: O(1)\n",
    "* Space: O(1)\n",
    "\n",
      "### Graph\n",
      "\n",
      "Graph will keep track of its:\n",
      "* nodes\n",
      "    * key: node id\n",
keep keep add keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph_solution.ipynb