graph_coloring
Color the vertices of a graph so that adjacent vertices receive different colors, using a greedy algorithm with strategy options like largest_first for efficient coloring.
Instructions
Color graph vertices using greedy algorithm
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| graph | Yes | ||
| strategy | No | largest_first |