MYSIMULATOR/ 2D LABS← All simulations
Interactive learning environment · Graph Theory

Graph Colouring Constraint Lab

Colour a network with a limited palette while a DSATUR heuristic resolves the most constrained vertices first.

Live model · Adjustable parameters · Real-time feedback
SIMULATION CANVASRUNNING
Adjust the controls to explore the model.

What you are exploring

Graph colouring assigns colours so adjacent vertices differ. DSATUR chooses the uncoloured vertex with the greatest number of distinct neighbour colours, then assigns the lowest available colour. This is a useful heuristic for scheduling and resource allocation.

How to experiment

Change one parameter at a time, observe the response, then reset and compare. The model runs locally in your browser and does not require an account or external libraries.

Made with 🤖 ChatGPT