🐀A maze generator is a flexible size random maze implemented using Union Find Set (Disjoint Set)
-
Updated
Apr 22, 2019 - C++
🐀A maze generator is a flexible size random maze implemented using Union Find Set (Disjoint Set)
This repo contains different university projects made by me, Alessio Mana and Fabrizio Sanino for our Algorithm and Data Structure Exam done in Turin in June 2021.
Generates and displays a maze using disjoint sets
Union-Find implementation using Python. (Union-By-Rank & Path-Compression)
Add a description, image, and links to the union-find-set topic page so that developers can more easily learn about it.
To associate your repository with the union-find-set topic, visit your repo's landing page and select "manage topics."