<commit_before>---
published: false
---
## A New Post

Enter text in [Markdown](http://daringfireball.net/projects/markdown/). Use the toolbar above, or click the **?** button for formatting help.<commit_msg>Create 2021-07-03-algorithm-disjkstra.md<commit_after>---
published: true
title: Dijkstra's Algorithm
tags: graph queue
---
> Dijkstra's algorithm for the shortest-path problem is one of the most important graph algorithms... However, going from the pseudocode to an actual implementation is made difficult by the fact that it relies on a priority queue with a "decrease key" operation... this operation is generally not supported. - [Actually Implementing Dijkstra's Algorithm](http://nmamano.com/blog/dijkstra/dijkstra.html)
{'fraction_non_alphanumeric': 0.10354223433242507, 'fraction_numerical': 0.010899182561307902, 'mean_word_length': 4.6976744186046515, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2636177', 'n_tokens_mistral': 212, 'n_tokens_neox': 193, 'n_words': 81}