Demonstration of the data structure union-find

My PRs: https://github.com/users/Ramy-Badr-Ahmed/projects/7

Generates and displays a maze using disjoint sets

The repository contains the topics learned while going through the course of Part 3 under the Algorithmic Specialisation - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming. I have implemented various fundamental algorithms under this course in this repo.

Shopee Code League 2021 - Multi-channel Contacts Problem. Solved with Union-Find Algorithm

Monte Carlo simulation to estimate percolation threshold.

Document 100 hard level algorithm practice starting from summer 2018

This is an empyrical analysis of the Union-Find data structure, together with many different heuristics for union and path compression.

Algorithms on Python, Ruby, Rust, Java and JavaScript

Union find PHP. This realization union find algorithm is a tool for searching chains of duplicates in CSV file (php). The solution can be an example of Union find implementation in PHP.

My solutions to Algorithms, Part I https://www.coursera.org/learn/algorithms-part1?

Single Header ANSI C mini libraries

A Rust implementation of the union-find disjoint set graph algorithm

This project was undertaken as part of our Algorithms course. The primary objective of this project is to implement and analyze Kruskal's algorithm for finding the Minimum Spanning Tree (MST) in a graph. The project also explores connected components within a graph, providing a comprehensive toolkit for graph analysis.

A collection of powerful data structures are using java

Interpreter for the conceptual language GKAT

Edited Images Analyser