One of the parallel coloring algorithms is the Jones Plassmann algorithm. This algorithm takes a graph as input and colors all the vertices.

OpenCilk is an open-source implementation of the Cilk concurrency platform, compatible with C and C++ and used for parallel programs.

We are given a graph G=(V, E). (Note: In a text file, edges information is given).

Example: A graph with four vertices (1,2,3,4) and five edges are given as below.

1 2

1 3

2 3

3 4

2 4

(Practically, the graph will be huge with millions of edges)

Question: For a given graph, implement the Jones Plassmann algorithm in OpenCilk.

Note: You can consult an implementation written in CUDA, but you have to implement your code in OpenCilk.

#####

Reply of the comment: What do you mean by "open click"? I need this problem to be solved in OpenCilk.