Dijkstra implementation without pairs

Правка en1, от whatthemomooofun1729, 2022-11-25 06:40:26

I recently read that you could improve the performance of the Dijkstra algorithm by getting rid of pairs and doing comparison operator overloading (https://cp-algorithms.com/graph/dijkstra_sparse.html#getting-rid-of-pairs)

Does anyone have this implementation?

Теги dijkstra, algorithms

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский whatthemomooofun1729 2022-11-25 06:40:26 300 Initial revision (published)