module Coloring:sig
..end
k
-coloring of undirected graphs.
A k
-coloring of a graph g
is a mapping c
from nodes to {1,...,k}
such that c(u) <> c(v)
for any edge u-v
in g
.
module type G =sig
..end
Minimal graph signature for Coloring.Make
.
module Make:
Provide a function for k
-coloring a graph.
module type GM =sig
..end
Minimal graph signature for Coloring.GM.Mark
.
module Mark:
Provide a function for k
-coloring a graph with integer marks.