Neat Tricks:

• when and what to use for vis

  • storing color as vivisted instead of just using a set
  • in a binary tree you cant go back so you dont need a visited set

• in the queue. you can store things like path lengths as well as the neigh-boring nodes

  q.append((nextnode, pathlen))