Color The Graph!!!

Discussions Toph Problems
1

You are given an acyclic, bidirectional graph with N nodes and M edges. The nodes are numbered from …

Click here to read the complete problem statement.

If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.

2

@hjr265 please update the problem statement.

1 Like
3

Thanks again, @rkb_rd. The problem statement has been updated.

1 Like
4

Can be disconnected acyclic graph (like forest) ? or always it’s a connected acyclic graph?