This repository contains all the algorithms implementation & problems solution, assignment solution, Interview question solution & other related materials (Slides, Resources) related to Princeton University algorithms Part I & II course at COURSERA

JavaFX application implementing Dijkstra's algorithm for shortest path visualization in GIS maps.

安卓图形化最短路径求解 (无向图+迷宫)，二维码扫描

Using Dijkstra's algorithm to find the best route between cities in the Gaza strip.

A GUI program for editing and solving common graph-theory problems.

Java-based application for finding shortest walking paths around the UW–Madison campus.

A social network and metro system representation - Shortest path problem

The implementation of Offlines & Onlines and other materials related to my academic course CSE 208 - Data Structure & Algorithms II

Implementation of maze generation algorithms and shortest pathfinding algorithms in a matrix with obstacles (with GUI)

Assignment 2 of Algorithms and Analysis Course at RMIT University.

Wisp Assist tool for Software Engineering Practice - uses Graph data structures and algorithms to model Wireless ISP mesh networks.

Ant Colony Optimization algorithm for the shortest path problem

Network Flows Optimization: Shortest path problems algorithms - Maximum flow problems algorithms - Minimum cost flow problem algorithms

implementation of Bellman-Ford algorithm to find the shortests paths

Graph search, shortest path , and MST algorithm visualizing software.

In this project, I have developed a topographic path planner designed for surveillance drones navigating through challenging terrains. The objective is to find the most cost-efficient path between two given coordinates while considering the elevation data of the geographical area.

Puzzle game colored lines

java program that finds all-pairs shortest paths for a given weighted digraph

This repository contains implementations of various artificial intelligence problems and algorithms.

A Command Line Interface (CUI) Delhi Metro application in Java utilizing graph algorithms like Dijkstra’s, DFS, and BFS for route finding, fare calculation, and network exploration.