A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units
-
Updated
Sep 16, 2018 - C
A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units
This is a very experimental A* pathfinding algorithm implementation to learn the algorithm and make tweaks to it.
Realization of Minesweeper game, with extended functionalities through the implementation and work with graphs using Dijkstra's and Warshall's algorithms.
A set of search algortithms over graphs, programmed in C++
This program tackles diverse graph-related challenges, from optimized Dijkstra algorithms for routing to a unique approach in component analysis.
Research work for shortest path algorithms.
Finding treasures in a hexagonal map and the minimal distance between one point to another
C codes for standard algorithms
Final project of "Algorithms and Principles of Computer Science" course - "Prova finale di Algoritmi e Principi dell'informatica" - Politecnico di Milano - A.A. 2020-2021
Calculate minimum paths with dijkstra and find the best graphs
Pathfinding application using Graphs and Data Structures
Linked-Lists and graphs in C for tasks assigned during Laboratory of Algorithms and Data Structures course @ UNINA.
Final project of Algorithms and Data Structures course held at Politecnico di Milano (2021/2022). Final vote: 30L/30
Advanced Algorithms in DSA
Exploring trees and graphs
Maze is a C library that is capable of scanning a complex maze and find the shortest path to end using Dijkstras algorithm. It can function independently as well as on any simulator or hardware. The same has been used to simulate a line follower robot on Coppeliasim ( VREP ) using its legacy remote API in C.
Dijkstra's shortest path parallel implementation
Projektni zadatak iz predmeta Softverski alati u elektroenergetici, januar 2018., Fakultet tehnickih nauka, Novi Sad
Add a description, image, and links to the dijkstra-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dijkstra-algorithm topic, visit your repo's landing page and select "manage topics."