Question

21: Assume that a graph is given as an array of pairs (edges) and the
colouring of the edges is given as an array of N nodes numbered
1 to N. If a particular colour assignment for the graph is given,
what is the (best) time complexity for verifying whether the given
colour assignment is valid or not?​

Answer 1

Answer:

Heiiiii

I can't understand what you want to say