Interactive Visualization of Pathfinding Algorithms (BFS, DFS, Bellman-Ford, Dijkstra, A*) on Bangalore’s Road Network.
Analysis of Algorithms II Course Assignments
Reading a 2 dimensional array from a file and printing the shortest paths as a Voronoi diagram. With and without cost.
A console-based Hospital Management System in C++17 — no frameworks, no external libraries. Pure DSA implementation using AVL Trees, Max-Heap, Hash Maps, Graphs, Dijkstra, Trie, Stacks, Queues and CSV-based data persistence.
Dijkstra and WarshallFloyd algorithm: finding shortest path
Solutions and practice exercises for Algorithm from LeetCode.
using dijsktra algorithm finds routes over given map
Project for "Algoritmi e Principi dell'Informatica" course Polimi A.A. 2022/2023
An app made in Godot 4.4 that allows you to generate mazes with 3 different algorithms and solve them with also 3 algorithms.
This project is a MVP web application for visualizing and comparing shortest routes on a road network using React, Leaflet, GeoServer, and a Node.js backend powered by PostgreSQL/PostGIS/pgRouting, with a comparative analysis of Dijkstra and A* shortest path algorithms.
Dijkstra's dinnig philosophers problem. Introduction to multithreaded programing, concurrency, shared memory space, data-races, deadlocks and other related concepts.
Solutions and practice exercises for Algorithm from LeetCode.
A multi-resolution landsacpe connectivity algorithm in Rust
Risk-aware resupply routing for contested logistics: min-cost flow, Edmonds-Karp max-flow/min-cut, and budget-constrained network interdiction. This Operations-research toolkit for contested-logistics routing and interdiction. From-scratch min-cost flow, max-flow/min-cut, and NP-hard interdiction is companion code to a 4-day algorithms unit.
To associate your repository with the dijsktra topic, visit your repo's landing page and select "manage topics."