Transition states som robot armen? Greedy algorithm? Minimum spanning tree?
Directed MST with binary elements Kruskals algorithm for search Dont rebuild graphs just change cost
BBU profile, B is how many board sets we have, rest is resources provided by board and cost of running BBU sets
0 1 3 5 10 0 2 4 6 10 +-----------+ +-----------+ +-----------+ +-----------+ | Internet | ---> | Cloud_cu | ---> | Cloud_du | ---> | Cloud_phy | +-----------+ +-----------+ +-----------+ +-----------+ | | | | v v v v +-----------+ +-----------+ +-----------+ +-----------+ | BBU_cu | ---> | BBU_du | ---> | BBU_phy | ---> | UE | +-----------+ +-----------+ +-----------+ +-----------+