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

this a prolog program wich make us to develop a coloriage graphe, we know for this problem the two node ajacent will not take the same color other the coloriage program I m make in this zip other progam in prolog-this is a prolog program wich make

DSATUR algorithme de coloration des graphe dsatur