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.
This program tackles diverse graph-related challenges, from optimized Dijkstra algorithms for routing to a unique approach in component analysis.
Different Computer Networks algorithms implementations.
USC 2019 Fall EE450 Computer Network Final Project Score: 91
Calculate minimum paths with dijkstra and find the best graphs
Final project of Algorithms and Data Structures course held at Politecnico di Milano (2021/2022). Final vote: 30L/30
Pathfinding application using Graphs and Data Structures
Advanced Algorithms in DSA
Respository for assignments during Laboratory of Algorithm and Data Structures course @ Università di Napoli Federico II.
A set of search algortithms over graphs, programmed in C++
Research work for shortest path algorithms.
Finding treasures in a hexagonal map and the minimal distance between one point to another
Repository created for share some contest's codes.
Knight's Tour Problem
Implementation for constructing a national road map
C codes for standard algorithms
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."