Parallel implementation of sparse and dense graph coloring in C
Number of vertices follows -n
graph -n 100
The program creates a graph with random edges connecting the vertices then calculates the sparseness of the created graph to determine whether to use dense matrix or csr matrix.