Skip to main content

chromatic_number

competitive::algorithm::chromatic_number

Function chromatic_number 

Source 
pub fn chromatic_number(n: usize, edges: &[(usize, usize)]) -> usize
Expand description

The smallest number of colors needed to color an undirected graph.

Examples found in repository?
crates/library_checker/src/graph/chromatic_number.rs (line 8)
5pub fn chromatic_number(reader: impl Read, writer: impl Write) {
6    prepare_io!(reader, writer);
7    sc!(n, m, uv: [(usize, usize); m]);
8    pp!(chromatic_number_library(n, &uv));
9}