          self.adjacent = OrderedDict()  # key = node, val = weight
  
  
  class Graph:
  
      def __init__(self):
 
</s> remove         self.results.append(result)
 </s> add         # TODO: Clean this up
        # Simplifies challenge coding and unit testing
        # but makes this function look less appealing
        self.results.append(int(str(result)))
    def __str__(self):
        return str(self.id)

          self.adjacent = OrderedDict()  # key = node, val = weight
  
    def __str__(self):
        return str(self.id)

  
  class Graph:
  
      def __init__(self):
keep add keep keep keep keep
 Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges. 
graphs_trees/graph/graph.py