Optimal route finding system for cargo ships using weather data, Dijkstra Algorithm and NodeJS - Thesis project

Real-time mathematical topology engine and 3D visualization dashboard for Washington D.C. transit (WMATA and Montgomery County RideOn) utilizing Spectral Graph Theory, sparse linear algebra, and Graph Heat Diffusion Kernels.

Interactive pathfinding visualizer — BFS, DFS, Dijkstra & A* implemented in C++ compiled to WebAssembly. Watch algorithms explore a grid in real-time with maze generation, weighted nodes & algorithm comparison mode.

Interactive A* and Dijkstra pathfinding visualiser on a weighted city grid. Built with Python and Pygame.

Test your geojson routing engine

Route planning system using Dijkstra, BFS, DFS on 31 Indian cities — DSA project

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

A C++ and HTML academic project that computes optimal travel routes using Dijkstra's algorithm, with a web-based visualization of the backend logic.

A full-stack inventory management system built with Flask and MongoDB.

Interactive network topology analyzer and visualization tool designed for CCNA networking concepts. Features dynamic node creation, routing simulation, Dijkstra shortest-path algorithm, ping animation, topology management, and real-time network device analysis using HTML5 Canvas and JavaScript.

short path duan-mao dijkstra vibecoded in JS

Este proyecto es una aplicación de escritorio en Python que permite gestionar ubicaciones geográficas (agregar, editar, eliminar nodos) y calcular rutas óptimas entre ellas. Usa un grafo con distancias geodésicas y el algoritmo de Dijkstra. La ruta se muestra en un mapa interactivo generado con Folium. Ejecuta app.py para iniciar la interfaz.

Interactive graph tool to visualize shortest path algorithms including Dijkstra and BFS. Built with vanilla HTML, CSS and JavaScript.

Dijkstra's algorithm in Javascript

A D3JS prototype to create a simple network in order to calculate the shortest road with Dijkstra algorithm

Centralized SDN controller with LLDP topology discovery, Dijkstra routing, link failure recovery, and REST-driven traffic policy enforcement. Built with Python, Ryu, and Mininet.

Empirical validation of Big-O bounds for Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Dijkstra exact operation counting, log-log regression analysis, automated PDF report and interactive web visualizer

Interactive JavaScript implementation of core sorting algorithms (Quicksort, Mergesort, Heapsort) and pathfinding algorithms (A*, Dijkstra) with browser-based visualization and console output.