
MinimumSpanningTreeFinder Background Much like ShortestPathFinder, this interface describes an object that simply computes minimum spanning trees. It turns out that we can use MST algorithms such as Prim’s and Kruskal’s to do exactly that! We’ll start this portion of the assignment by implementing Kruskal’s algorithm, and afterwards you’ll use it to generate better mazes.

* You should have received a copy of the GNU General Public License * GNU General Public License for more details. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * but WITHOUT ANY WARRANTY without even the implied warranty of

* This program is distributed in the hope that it will be useful, * the Free Software Foundation, either version 3 of the License, or * it under the terms of the GNU General Public License as published by * This program is free software: you can redistribute it and/or modify

Could you look over my code and suggest any improvements possible? /* It uses depth-first search and is written is C++. I have made a random maze generator that allows for custom sizes via command arguments.
