My implementation for the "Algorithms and Data Structures" exam project at Politecnico di Milano, A.Y. 2020-21
-
Updated
May 21, 2022 - C
My implementation for the "Algorithms and Data Structures" exam project at Politecnico di Milano, A.Y. 2020-21
A program can calculate OSPF with variable edge code and consider edge loading
Dijkstra's algorithm for finding shortest paths using OpenMP and MPI
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.
Implementation of different Data Structures
A basic C-based Dijkstra's algorithm application for finding shortest paths in city networks. Features user-specified input and min-heap for efficiency.
This is my final project of Parallel and Distributed Computing which solves the K Shortest Path Problem using parallelized Djkistra's Algorithm.
Line following Maze solving with shortest path bot. Made under mentorship programme Eklavya 2020 hosted by SRA VJTI.
Subway shortest path is calculated using adjacency matrix and Dijkstra's algorithm
Tarkvara projekt, mille eesmärk on ära lahendada proovireisija ülesanne.
A collection of minigames that exhibit the use of Mathematical Concepts such as Game Theory, Shortest Path Algorithms, and more.
Лабораторные работы по дисциплине "Программирование" 1 курса ФИТ НГУ
Analiza distanțelor dintre stații, ruta optimă între două stații și minimizarea căii ferate. Aplicații asupra datelor C.F.R.
C program to determine path between two railway stations of Mumbai Local.
An algorithmic approach to effectively manage exports in India using Hyperloop trains ;-)
Exploring trees and graphs
A pathfinding algorithm
Knight's Tour Problem
Example of a C program that returns the shortest path between two cities.
Add a description, image, and links to the dijkstra-shortest-path topic page so that developers can more easily learn about it.
To associate your repository with the dijkstra-shortest-path topic, visit your repo's landing page and select "manage topics."