- Loading...
Sponsored by Dometrain Courses—Get 30% off Dometrain Pro with code ANDREW30 and access the best courses for .NET Developers

My new book ASP.NET Core in Action, Third Edition is available now! It supports .NET 7.0, and is available as an eBook or paperback.

Implementing Dijkstra's algorithm for finding the shortest path between two nodes using PriorityQueue in .NET 9
In this post I describe Dijkstra's algorithm for finding the shortest path between two nodes and how you can implement it with the PriorityQueue type in .NET 9…

Behind the implementation of .NET's PriorityQueue
In this post I show how .NET's PriorityQueue implements its methods and relate these methods to operations on a min-heap data structure…

An introduction to the heap data structure and .NET's priority queue
In this post I provide an introduction to the heap data structure, describe why it's useful, and show how it's used in .NET's PriorityQueue type.…

