Hacker News new | ask | show | jobs
by bogomipz 2658 days ago
Isn't that just the classic graph coloring problem though? A tree is just a type of graph.
1 comments
chillee 2658 days ago
Well, A. Not exactly because there's no restrictions on when you can color nodes black, and B. Graph coloring in general is NP-complete while this problem has an O(n) solution.
link