Hello, I’ve got an assignment from my math teacher to do with c++, because I am studying IT. The problem is that we didn’t even learn c++, I know only what I thought myself, so I need someone’s help. The task is to make a simple program that would be able to find an answer for greedy coloring method. I have a graph G, the answer should look something like this: 1, 3, 5, 6 belong to color 3; 4, 8 belong to color 2; 2, 6 belong to color 1. http://imgur.com/3zesQo1 Can someone help me with this? I found some source code on the internet but I need much more simple code, so I would be able to explain what is happening in the program.
Graph: http://imgur.com/jddZQi5