# Graph - Dijkstra's algorithm (Shortest-Path First - SPF)

### Table of Contents

## About

The Dijkstra's Shortest Path First algorithm (SPF) is an algorithm for finding the shortest paths between nodes in a graph

## Articles Related

## Documentation / Reference

- The Humble Programmer by Edsger W. Dijkstra - ACM Turing Lecture 1972 - EWD340