refactor(algorithms, graphs): equality check

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

algorithms/graphs/cat_and_mouse/__init__.py

@@ -44,7 +44,7 @@ def parents(m, c, t):
         # for every parent of this node i, j, t :
         for i2, j2, t2 in parents(i, j, t):
             # if this parent is not colored :
-            if color[i2, j2, t2] is draw:
+            if color[i2, j2, t2] == draw:
                 # if the parent can make a winning move (ie. mouse to MOUSE), do so
                 if t2 == c:  # winning move
                     color[i2, j2, t2] = c