medil.ecc_algorithms

Implementations of edge clique clover finding algorithms.

Functions

add_isolated_verts(cover)
branch(graph, k_num_cliques, the_cover, ...)	Helper function for find_clique_min_cover().
find_clique_min_cover(graph[, verbose])	Returns the clique-minimum edge clique cover.
find_heuristic_1pc(graph)
max_cliques(nbrhood)	Adaptation of NetworkX code for finding all maximal cliques.