Hot Hẻm: Routing tool not for the fastest nor the coolest path, but the hottest path. A downscaled case study in Sài Gòn, Việt Nam (Hồ Chí Minh City / HCMC) districts 1, 2, and 8.

computer science assignments

a Graph-based Integration of Network Traffic Flow Analysis: a Case Study.

A Java-based public transport routing engine for Maastricht, integrating GTFS data, shortest-path algorithms, and urban accessibility metrics via a Java Swing GUI.

The projects models the flightpath of a drone while it makes deliveries. The projects compares different algorithms and their suitability.

It's a simple yet powerful pathfinding application that utilizes Dijkstra's algorithm to find the shortest path between multiple nodes in a graph.

Dijkstra algorithm web application

SmartXNavigator is an advanced route planning tool that leverages geographic and traffic data to provide optimized travel routes. Utilizing Pathfinding algorithms, it calculates the shortest or quietest paths based on user preferences.

About SmartXNavigator is an advanced route planning tool that leverages geographic and traffic data to provide optimized travel routes. Utilizing Pathfinding algorithms, it calculates the shortest or quietest paths based on user preferences.

Java implementation of Dijkstra's Algorithm for pathfinding. It was developed during my school computer science lessons and got implemented in Greenfoot. It simulates a rover navigating a grid using node and edge classes.

nextdataAI: a Python library for solving mazes using classical algorithms (A*, BFS, DFS, Dijkstra, Greedy), reinforcement learning (QLearning, QTable, QNN, QLSTM), and novel pseudo-heuristics. Features include a neural network-based heuristic approximating Manhattan distance (NNHeuristic) and a custom SManhattan heuristic, a dataset gener

Free hands-on course with the implementation (in Python) and description of several computational, mathematical and statistical algorithms.

"GPS Navigator: Your efficient travel companion! Utilize Dijkstra's algorithm for shortest routes, making travel planning a breeze with HTML, CSS, and JavaScript. Easy, accurate, hassle-free navigation."

a set of codes for implementing djikstra algorithm to finding shortest path around maranatha christian university.

A simple interactive website for demonstrating various pathfinding algorithms.

A WebApp was created to solve for a case study on finding the shortest paths to deliver products and linearly assigning problem in a warehouse. The app is based on the Branch and Bound algorithm for the TSP and the Hungarian algorithm for the VAS assignment.

Este aplicativo tem o objetivo de descobrir de forma prática o menor caminho entre as cidades da microrregião da Serra da Ibiapaba no Ceará.

daa_project :- project for the exploration and implementation of Dijkstra's algorithm in real life over a small scale map of my locality for finding optimized route

Project for the second-semester course "Data Structures and Algorithms I" (ST0245) taught at EAFIT University (Medellín, Colombia) by prof Mauricio Toro