  class Node:
  
      def __init__(self, id):
          self.id = id
          self.visited = False
          self.adjacent = OrderedDict()  # key = node, val = weight
  
      def __str__(self):
          return str(self.id)
  
 
</s> remove     "        self.visited = False\n",
 </s> add     "        self.visit_state = State.unvisited\n",
        self.visit_state = State.unvisited
  class Node:
  
      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)
  
keep keep keep keep replace keep keep keep keep keep
 Added three state variable visit_state which will be useful for more advanced challenges such as topological sort. 
graphs_trees/graph/graph.py