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

Generate and solve mazes using various algorithms

This project contains the implementation of basic graph theory algorithms like BFS, DFS, Kruskal's MST, Prim's MST, Dijkstras Shortest Path

Exercises of Coding Ninjas Java DSA

Data Structures And Algorithms

A random dungeon generated with a minimum spanning tree and Yonaba's Jumper pathfinding library. (Love v0.10.2 or v0.9.2)

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

🌲 XML and Drawing, Arrays, Hashing, Sets, Maps, Recursion, Sudoku Solver, Graphs, Dijkstras, PriorityQueue, Heaps, Kruskals, Bloom Filter, Trie, AVL Tree, BTree 🐍

Kruskal's Algorithm (greedy) to find a Minimum Spanning Tree on a graph

The purpose of this project is to solve the shortest path problem, one of the fundamental theoretic problems known in graph theory, and how Dijkstra's algorithm can be used to solve it. Done as part of the final project for MOOC on Graph Theory by UCSD.

Implementation of MST Algorithms - 1. Prim's Algorithm (with 3 versions - PriorityQueue<Edge>, PriorityQueue<Vertex>, and IndexedBinaryHeap<Vertices>) and 2. Kruskal's Algorithm on Connected Graphs.

Implementation of Kruskal's and Prim's minimum spanning tree algorithms.

Developed predictive model to forecast flight delays, clustered airports to enhance efficiency, and used Dijkstra’s algorithm for shortest flight paths, leading to fuel savings. Optimized intra-state connectivity with Kruskal's algorithm and created a linear programming model that minimized delay penalties.

Minimum Spanning Tree

VISTRA — Desktop-Applikation zur Visualisierung von Graphenalgorithmen

Maze Generator Game using a modified Kruskal’s Algorithm

A visualizer to visualize path fining algorithms like A* and Dijkstra, and the maze generating algorithms like Prim's and Kruskal's. This visualizer is created by react.js.

My own implementations of common algorithms.

Quick algorithm to create clusters of nodes or forest of MST on graph