Dijkstra's shortest path in parallel.
-
Updated
Sep 2, 2020 - Go
Dijkstra's shortest path in parallel.
SPB subway simulator
This repository contains graph algorithms made in golang by Lars M Bek and Ida M Jensen. It contains interface driven code, that is open-sourced. It contains: Graph, Dijkstra algorithm and will have more in the future.
The implementation of Dijkstra Algorithm in Go language
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.
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."