This project leverages real-time data from Ile-de-France Mobilités (IDFM) to provide an efficient metro navigation system for Paris and Bordeaux (using a simplified dataset). It utilizes graph algorithms to calculate shortest paths, visualize the minimum spanning tree of the metro network, and check network connectivity.

Usage of A*/Astar algorithm

WHERE_IS_MY_LECTURE The project is designed around Jaypee Institute Of Information Technology-128 map, around all three floors highlighting the shortest route to your lecture hall. It uses the concept of Graph data structure to add classrooms and its connections and the djisktra algorithm to find the shortest route.

This project implements the solution to find the shortest path in a directed graph using Dijkstra's algorithm.

Dijkstra Solver dal design efficace per creare e caricare esercizi su Dijkstra con visualizzazione di tutti i cammini minimi e con archi direzionabili

This project finds the smallest path with minimum spanning tree value of connection to loads and source which is Minimum Spanning Tree of the undirected graph and finds the shortest paths from a single source to all load points and the graph is directed graph.

JIIT Connect enhances the university experience by providing comprehensive guides, advanced features, and fostering community engagement for students at JIIT. Connect, explore, and thrive effortlessly on campus.

My solution to the mandatory assignment in the subject IN2140 - Introduction to operating systems and data communication at the University of Oslo. This mandatory assignment was related to making router operations more effective. Implemented in C.

Code from Problem Solving with Algorithms and Data Structures using Python

This project is a campus navigation system written in Go for a data structures course. It uses the Gin framework and Redis, focusing on graph data structures and Dijkstra's algorithm for shortest path finding.

Data-driven graph-based analysis of commonly used roads in a large-scale transportation network (developed under SRILab, UCLA)

Developed predictive model to forecast flight delays, clustered airports to enhance efficiency, and used Dijkstra’s algorithm for shortest flight paths, leading to fuel savings. Optimized intra-state connectivity with Kruskal's algorithm and created a linear programming model that minimized delay penalties.

Implementation of Dijkstra Shortest Path algorithm with C++ and SFML.

This is my final project of Parallel and Distributed Computing which solves the K Shortest Path Problem using parallelized Djkistra's Algorithm.

A repository containing resources for SYBTech CSE.

Interactive graph-creator and visualizer for graph-algorithms (Swing)

Different operation of Directed Graph or Undirected Graph using C++