about summary refs log tree commit diff
path: root/scratch/deepmind/part_two/todo.org
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-03-19T12·31+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-03-19T12·31+0000
commit380a6a352c6fe0a5fb4859366ae937129a728f8c (patch)
tree5341c524b33c51647f4e46d53a1384c2f8f928db /scratch/deepmind/part_two/todo.org
parent1d45f146158b0bc678f4204f2c22d481d3ea20a7 (diff)
Solve InterviewCake's graph-coloring problem
Write a function that colors the nodes of a graph such that no two neighbors
share a color.
Diffstat (limited to 'scratch/deepmind/part_two/todo.org')
-rw-r--r--scratch/deepmind/part_two/todo.org2
1 files changed, 1 insertions, 1 deletions
diff --git a/scratch/deepmind/part_two/todo.org b/scratch/deepmind/part_two/todo.org
index a2ce2fb23dff..b767ecb3d4a0 100644
--- a/scratch/deepmind/part_two/todo.org
+++ b/scratch/deepmind/part_two/todo.org
@@ -24,7 +24,7 @@
 ** DONE Balanced Binary Tree
 ** DONE Binary Search Tree Checker
 ** DONE 2nd Largest Item in a Binary Search Tree
-** TODO Graph Coloring
+** DONE Graph Coloring
 ** TODO MeshMessage
 ** TODO Find Repeat, Space Edition BEAST MODE
 * Dynamic programming and recursion