GitHub / emrecantural / Using-Dijkstras-Algorithm-with-OpenMP
In this project, we will use the algorithm we learned in the Graph Theory course: Dijkstra's Algorithm. The main purpose of the algorithm is to find the shortest path on Graf.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/emrecantural%2FUsing-Dijkstras-Algorithm-with-OpenMP
PURL: pkg:github/emrecantural/Using-Dijkstras-Algorithm-with-OpenMP
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: C++
Size: 4.88 KB
Dependencies parsed at: Pending
Created at: about 5 years ago
Updated at: about 1 year ago
Pushed at: about 5 years ago
Last synced at: about 1 year ago
Topics: dijkstra-algorithm, openmp, parallel-programming