can you tell me the approach that i have k*n nodes where k,n are integers and no two adjacent nodes can have same colours and i want to colour the trees with n colours. (i am making trees not graphs.) thanks. any help will be appreciated.

Recommended Answers

  1. We don't do your school work for you.
  2. If you don't understand the question, see your professor.
  3. If you make a concerted effort to solve the problem, but have coding issues/errors, then we may help you.

Good luck!

Jump to Post

All 2 Replies

  1. We don't do your school work for you.
  2. If you don't understand the question, see your professor.
  3. If you make a concerted effort to solve the problem, but have coding issues/errors, then we may help you.

Good luck!

sir, it is not my homework and nothing like that. it's just a question i came across. the problem was not this. I have thought a lot on this and then only i have simplified it much so that anyone can understand it easily. (if my thinking is not shown here, that doesn't mean i haven't thought.). thanks. i dont want any code or anything. i just want approach or some algo or some thought process. thanks if you can help me.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.