      "collapsed": false
     },
     "outputs": [],
     "source": [
      "from collections import OrderedDict\n",
      "\n",
      "\n",
      "class Node:\n",
      "\n",
      "    def __init__(self, id):\n",
      "        # TODO: Implement me\n",
      "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
 
</s> remove     "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
 </s> add     "        self.adjacent = {}  # key = node, val = weight\n", </s> remove     "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
 </s> add     "        self.adjacent = {}  # key = node, val = weight\n", </s> remove     "        self.nodes = OrderedDict()  # key = node id, val = node\n",
 </s> add     "        self.nodes = {}  # key = node id, val = node\n", </s> remove     "from collections import OrderedDict\n",
 </s> add  </s> remove     "    unvisited = 1\n",
 </s> add     "    unvisited = 0\n",
    "    visiting = 1\n",
      "collapsed": false
     },
     "outputs": [],
     "source": [



      "class Node:\n",
      "\n",
      "    def __init__(self, id):\n",
      "        # TODO: Implement me\n",
      "        self.adjacent = OrderedDict()  # key = node, val = weight\n",
keep keep keep keep replace replace replace keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph_challenge.ipynb