  
      def __init__(self, id):
          self.id = id
          self.visit_state = State.unvisited
          self.adjacent = OrderedDict()  # key = node, val = weight
  
      def __str__(self):
          return str(self.id)
  
  
 
</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     "from collections import OrderedDict\n",
    "\n",
    "\n",
 </s> add  </s> remove         self.nodes = OrderedDict()  # key = node id, val = node
 </s> add         self.nodes = {}  # key = node id, val = node
        self.adjacent = {}  # key = node, val = weight
  
      def __init__(self, id):
          self.id = id
          self.visit_state = State.unvisited
        self.adjacent = {}  # key = node, val = weight
  
      def __str__(self):
          return str(self.id)
  
  
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph.py