Dijkstar
psqueues
Dijkstar | psqueues | |
---|---|---|
1 | 1 | |
52 | 63 | |
- | - | |
4.5 | 5.2 | |
7 months ago | 8 months ago | |
Python | Haskell | |
MIT License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Dijkstar
-
-🎄- 2021 Day 15 Solutions -🎄-
Then I stumbled upon Dijkstar, which is an implementation of Dijkstra in python that has the ability to pass in your own heuristics function to customise how it runs. In this case the default behaviour gave me exactly what I needed and even returns total cost.
psqueues
-
-🎄- 2021 Day 15 Solutions -🎄-
A super-ugly Dijkstra implementation with psqueues for priority queues. Before I took them into use the first part took ~10 sec, after that it's ~60ms, and 2.5s for the second part. I believe, there's still room for optimization, but it's enough for today.
What are some alternatives?
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
miso - :ramen: A tasty Haskell front-end framework
Advent-of-Code - 🎄 My Advent of Code solutions 🎄
fgl - A Functional Graph Library for Haskell
adventofcode - Advent of code
containers - Assorted concrete container types
CPython - The Python programming language
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
graphite - Haskell graphs and networks library
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
nonempty-containers - Efficient non-empty variants of containers data types, with full API
haggle - An efficient graph library for Haskell