Dijkstar
Graphs, Dijkstra, A*, shortest paths, HTTP graph server (by wylee)
adventofcode
Advent of code solutions (by mathsaey)
Dijkstar | adventofcode | |
---|---|---|
1 | 55 | |
52 | 20 | |
- | - | |
4.5 | 7.8 | |
7 months ago | 6 months ago | |
Python | Elixir | |
MIT License | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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
Posts with mentions or reviews of Dijkstar.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-14.
-
-🎄- 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.
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
-
-❄️- 2023 Day 10 Solutions -❄️-
Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-
What are some alternatives?
When comparing Dijkstar and adventofcode you can also consider the following projects:
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode2021 - Advent of code 2021
Advent-of-Code - 🎄 My Advent of Code solutions 🎄
adventofcode - Advent of code
adventofcode - Answers to Advent of Code
CPython - The Python programming language
roast - 🦋 Raku test suite
rockstar - The Rockstar programming language specification
aoc2021 - Advent of Code 2021 - my answers
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
AoC - my personal repo for the advent of code yearly challenge
Dijkstar vs adventofcode
adventofcode vs AdventOfCode2021
Dijkstar vs Advent-of-Code
adventofcode vs adventofcode
Dijkstar vs adventofcode
adventofcode vs adventofcode
Dijkstar vs CPython
adventofcode vs roast
adventofcode vs rockstar
adventofcode vs aoc2021
adventofcode vs aoc2021
adventofcode vs AoC