Module Coloring


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.


exception NoColoring

Graph coloring for graph with integer marks.
module type GM = sig .. end
module Mark: 
functor (G : GM) -> sig .. end
Graph coloring with marking.

Graph coloring for graphs without marks
module type G = sig .. end
module Make: 
functor (G : G) -> sig .. end