support@chatgptassignment.com
In projects three and five you most likely used an implicit graph structure to solve the word ladder
problem. Most solutions would have generated neighboring words on the fly and used some kind of
map structure to keep track of the optimal path. This project will explore the use of an explicit graph
structure and will lead into an elegant solution for the seemingly complex problem of register allocation
within compilers.
This project is divided into two parts:
Part 1: implement a graph data structure called the interference graph
Part 2: use your graph to solve the register allocation problem via graph coloring