Coloring a given tree(connect acyclic Graph) with following conditions:
1. No use of prepared Class
2. if vector A is connect to B and B to C (A-B & B-C) => A & B & C must have diffent Colors
3.print the minimum colors needed & the color of each vector
5 (amount of vectors)
1 2 1 3 2 4 2 5 (edges)
output:
4 (minimum color neede)
1 = 1 (number of each vector and its color)
2 = 2
3 = 3
4 = 3
5 = 4