graph coloring optimizer playground
graph
triangle (K3)
4-cycle
path (5 nodes)
star (6 nodes)
complete graph (K4)
petersen graph
random graph (10 nodes)
optimizer
gradient descent + line search
L-BFGS
newton's method
nesterov momentum
langevin annealing
colors (q):
3
unit-term weight (λ):
1.0
step
play
reset (random)
ColorObj total
-
discrepancy sum
-
unit-penalty sum
-
step count
0
show code