graph_coloring
Assigns colors to an undirected graph's vertices using a greedy algorithm, ensuring no adjacent vertices share a color.
Instructions
Color vertices of an undirected graph using a greedy algorithm so no adjacent vertices share a color.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Undirected edges as [u, v] pairs | |
| vertices | Yes | Number of vertices (0-indexed) |