unionfind

A collection of powerful data structures

This study plan is for those who want to prepare for technical interviews but are uncertain which problems they should focus on. The problems have been carefully curated so that levels 1 and 2 will guide beginner and intermediate users through problems that cover the data structures and algorithms necessary to succeed in interviews with most mid-tier companies. While level 3 provides material to help users whose targets are top-tier companies.

An Implementation of WUFPC algorithm and its application in percolation threshold problem in C++ language.

4 algorithms of union find, quick find, quick union, weighted quick union and weighted quick union with path compression.

Generic implementation of Union-Find data structure.

数据结构与算法

UnionFind data structure implemented with QuickFindTree with amortized cost of the union ( O(logn) )

A school project for creating a java-based maze and playable zombies to flee from the maze with unionfind.

Implementation of common algorithms in python

A program to link actors together via their movie, using hashing to create a map and make searching faster

Generates and displays a maze using disjoint sets

Create Minimum Spanning Tree using Union Find and Kruskal algorithms.