Maze procedural generation - Kruskal Algorithm

What I learned

• C# linked list recursion : each edge class has two adjancent tiles has nodes. To find out whether we should remove an edge we have to consider whether its tiles belong to the same set. So the algorithm loops through both tiles’s parent nodes, using recursion until the highest parents are found. If they are not the same, it means that the sets are not connected yet. And to achieve that the edge is removed.