      "\n",
      "class State(Enum):\n",
      "    unvisited = 1\n",
      "    visited = 2\n",
      "    visiting = 3\n",
      "\n",
      "\n",
      "class Node:\n",
      "\n",
      "    def __init__(self, id):\n",
 
</s> remove     "    unvisited = 1\n",
 </s> add     "    unvisited = 0\n",
    "    visiting = 1\n", </s> remove     "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
 </s> add     "        self.adjacent = {}  # key = node, val = weight\n", </s> remove     "from collections import OrderedDict\n",
    "\n",
    "\n",
 </s> add  </s> remove     "from collections import OrderedDict\n",
 </s> add  </s> remove     "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
 </s> add     "        self.adjacent = {}  # key = node, val = weight\n",
      "\n",
      "class State(Enum):\n",
      "    unvisited = 1\n",
      "    visited = 2\n",

      "\n",
      "\n",
      "class Node:\n",
      "\n",
      "    def __init__(self, id):\n",
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph_solution.ipynb