Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.

exact DSATUR algorithm colouring grapg minimum number of colours

基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classe

DSATUR algorithme de coloration des graphe dsatur