Data structures and algorithms in X minutes. Code examples from my YouTube channel.

Coursera's Data Structures and Algorithms Specialization

A simple graph library

A python package for constructing and analysing minimum spanning trees.

Python implementation of the Yamada-Kataoka-Watanabe algorithm to find all minimum spanning trees in an undirected graph.

🔗100 algorithms for 100 days. Can I do it?

Performance Comparison of Prim's Algorithm using Different Priority Queues

Functional connectivity and brain network analysis for motor imagery data in stroke patients

The thesis presents the parallelisation of a state-of-the art clustering algorithm, FISHDBC. This objective has been achived by improving the main data structures and components of the algorithm: HNSW, MST and HDBSCAN. My contribution is based on a lock-free strategy, completely wrote in Python.

My implementations of Basic to Advanced data structures and Algorithms in python

Snake AI which utilizes Prim's Minimum Spanning Tree algorithm and Hamiltonian Cycles in order to find an optimal path around the game grid.

Clustering Financial Time Series

Python implementation of distributed GHS algorithm

High-performance tool for constructing Minimum Spanning Trees from symmetric distance matrices. Features Numba-accelerated algorithms, parallel processing, and zero-distance grouping. Outputs MST in standard Newick format.

MST-Kruskal algorithm in Python using union-find data structure

Implementing graph theory concepts using networkx library

A Kruskal's algorithm implementation using Python tkinter

Advanced Algorithms | Spring 2021 | MST for 2-approx of metric TSP

Learn pyspark

An implementation of Boruvka's algorithm to find a minimum spanning tree in a graph.