  
  class State(Enum):
      unvisited = 1
      visited = 2
      visiting = 3
  
  
  class Node:
  
      def __init__(self, id):
 
</s> remove     unvisited = 1
 </s> add     unvisited = 0
    visiting = 1 </s> remove from collections import OrderedDict
 </s> add  </s> remove     "    visiting = 3\n",
 </s> add  </s> remove     "    unvisited = 1\n",
 </s> add     "    unvisited = 0\n",
    "    visiting = 1\n", </s> remove         self.nodes = OrderedDict()  # key = node id, val = node
 </s> add         self.nodes = {}  # key = node id, val = node
  
  class State(Enum):
      unvisited = 1
      visited = 2

  
  
  class Node:
  
      def __init__(self, id):
keep keep keep keep replace keep keep keep keep keep
 Rework graph challenge and solution (#86) 
graphs_trees/graph/graph.py