Java app to visualize swiss trains network with Dijkstra and Floyd

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.

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.

https://useful-journey-3db.notion.site/743-Network-Delay-Time-cc99e63648254d1096706a09f623478f

Shortest path between cities in Colombia

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

#1 try to implement graphs in Javascript (in HTML files)

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.

A visualization of common graph algorithms. Hosted @ https://lumunge.github.io/Graph-Algorithms-Visualization/index.html

Dynamic Routing (Single-Source Shortest-Path Algorithms) with Network Graph Editor GUI

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

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

A simple interactive website for demonstrating various pathfinding algorithms.

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.

Artificial Intelligence Fundamentals Project by Paul Magos and Stefano Zanoni.

Travello is a trip advisor app which will help you to find the cheapest and fastest routes for your destination.