Skip to content

Parallel implementation of sparse and dense graph coloring in C

Notifications You must be signed in to change notification settings

ritisha2000/GraphColoring

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

GraphColoring

Parallel implementation of sparse and dense graph coloring in C

Usage

Number of vertices follows -n

graph -n 100

Explanation

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.

About

Parallel implementation of sparse and dense graph coloring in C

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages