chromatic number of the graph!!

Правка en2, от Vesper_Lynd, 2019-05-01 16:57:54

I was given the assignment problem related to finding chromatic number of the graph and i was able to write a solution at that time,but i realised from my friend that it is an NP hard problem and i used "BFS" to just implement so i think it should fail at some test case, so can anybody help me finding the test case to prove it wrong!!

/*Here is the code*/

LINK

Regards!!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Vesper_Lynd 2019-05-01 16:57:54 723
en1 Английский Vesper_Lynd 2019-05-01 16:56:42 1136 Initial revision (published)