module Clique: sig .. end
sig
end
This algorithm will find and return all maximal cliques in an undirected graph.
module type G = sig .. end
module Bron_Kerbosch: functor (G : G) -> sig .. end
functor (
G
:
) ->