[Idea]: Graph coloring Tree spanning algorithm

[yashksaini-coder]

Idea Title

Tree spanning algorithm

Idea Description

Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. This problem is widely used in scheduling, register allocation in compilers, and many other optimization areas.

Potential Benefits

• [X] Improves user experience
• [X] Enhances learning
• [ ] Adds a new feature
• [ ] Improves code quality
• [ ] Other

Implementation Suggestions (Optional)

• isSafe: Checks if it’s safe to color a vertex with a particular color.
• graphColoringUtil: Tries to color each vertex and recursively backtracks if needed.
• graphColoring: The main function that initializes color assignments and starts the recursive coloring.

[yashksaini-coder]

@ajay-dhangar can you assign this issue to me with proper labels too