Loading...
Graph Coloring Demo
Solver
Greedy, picking Nodes by order of definition
Greedy, picking Nodes with ascending degree
Greedy, picking Nodes with descending degree
Greedy, picking Nodes with most colored neighbors
Greedy, swapping colors if needed
Simple Partitioning Algorithm
Wigdersons first algorithm
Wigdersons second algorithm
Graph
Define own graph
Graph as edge list
Graph as adjacency matrix
Erdos-renyi-graph
Anzahl der Knoten:
Cliquengroesse:
Kantendichte:
Delay
0.5s
Start
Stop