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."

Python Vacuum Cleaner Robot Algorithm and Demo

A teaching tool that can be used for easy visualization of Dijkstra's algorithm.

visualizes five pathfinding algorithms and maze generation algorithms.

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

computer science assignments

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

React-based web application to visualize Path Finding algorithms like Dijkstra, BFS, and DFS.

(Esteban Vergara Giraldo - Miguel Angel Cock Cano - Sebastian Camacho Palacio) Data and algorithm project (EAFIT) [1st semester].

Visualizer for some search algorithms — currently A* and Dijkstra's algorithms — using JavaScript, jQuery, HTML, CSS, and some third party JS libraries.

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á.

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.

Javascript Dijstras shortest path calculator in a Directed Weighted Acyclic graph

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

My submission to a coding competition

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.

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

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