          return str(self.id)
  
  
  class Graph:
  
      def __init__(self):
          self.nodes = {}  # key = node id, val = node
 
</s> remove         self.nodes = OrderedDict()  # key = node id, val = node
 </s> add         self.nodes = {}  # key = node id, val = node </s> remove     "        self.nodes = OrderedDict()  # key = node id, val = node\n",
 </s> add     "        self.nodes = {}  # key = node id, val = node\n", </s> remove     "        self.nodes = OrderedDict()  # key = node id, val = node\n",
 </s> add     "        self.nodes = {}  # key = node id, val = node\n", </s> remove         self.adjacent = OrderedDict()  # key = node, val = weight
 </s> add         self.adjacent = {}  # key = node, val = weight
    def add_neighbor(self, neighbor, weight=0):
        self.adjacent[neighbor] = weight

          return str(self.id)
  
    def add_neighbor(self, neighbor, weight=0):
        self.adjacent[neighbor] = weight

  
  class Graph:
  
      def __init__(self):
          self.nodes = {}  # key = node id, val = node
keep add keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph.py