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.

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

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

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

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

A social network and metro system representation - Shortest path problem

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

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

implementation of Bellman-Ford algorithm to find the shortests paths

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

Assignment 2 of Algorithms and Analysis Course at RMIT University.

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

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

Puzzle game colored lines

This repo contains utilities like DFS, BFS and connected components. Using them you can validate if there exists a path between vertices and find it too. You can also find shortest path between two vertices of graph using these classes.

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

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.

Efficient Java Solution to Compute the Optimal Subgraph in Weighted Directed Graphs

A graph toolkit made with Java