← Back to Algorithms
Graph Coloring
Color vertices of a graph such that no two adjacent vertices share the same color.
Graph Edges (one edge per line, format: A-B):
Enter each edge on a new line using the format: vertex-vertex (e.g., A-B)
Number of Colors:
Animation Speed:
Normal
Visualize
Reset
Random Input
← Previous
Play
Next →
Step 0 of 0
Time Complexity:
O(M^V)
Space Complexity:
O(V)
How it works
Color vertices of a graph such that no two adjacent vertices share the same color.