Your TA Allyson is building a secret underground hideout, and wants all the rooms in her hideout to be connected. She ca
Posted: Mon May 02, 2022 12:08 pm
Your TA Allyson is building a secret underground hideout, and wants all the rooms in her hideout to be connected. She can connect any two rooms by digging a tunnel, but the dirt is tougher in some places than others. What algorithms can she run to figure out the easiest way to connect all the rooms? Dijkstra's A* Prim's Kruskal's Bogo sort? None of the above