Azer0s / Azer0s/tinygraph

Implement Dijkstra’s Algorithm

Open
#6 0 comments 0 reactions 0 assignees View on GitHub
enhancement help wanted
Dominant language
C++
Stars
2
Forks
1
PR merge metrics
No merged PRs in 30d

Description

> Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

![](https://www3.cs.stonybrook.edu/~skiena/combinatorica/animations/anim/dijkstra.gif)

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.