fgl
Advent-of-Code
fgl | Advent-of-Code | |
---|---|---|
5 | 42 | |
183 | 9 | |
0.5% | - | |
6.6 | 8.6 | |
20 days ago | 4 months ago | |
Haskell | Python | |
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.
fgl
-
N-ary Tree data structure with efficient parent access?
Your names are good, I reckon it is Martin Erwig's fgl stuff and Andrey Mokhov's algebraic-graphs that you have in mind.
-
Library for Tree-like data structure
I am about to start a new project in Haskell, model checking with (new) tree-like data structures. I think it is best to start building on a library such that i can already have elegant base functions, yet i am wondering what library is currently the standard? I read about fgl ( https://hackage.haskell.org/package/fgl ), yet it is a very old library.
-
Want to start a new project and I'm wondering if Haskell is the right tool for it
Couple of approaches to graphs that are state-free: functional graphs and algebraic graphs
-
-🎄- 2021 Day 12 Solutions -🎄-
Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-
-🎄- 2021 Day 9 Solutions -🎄-
For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.
Advent-of-Code
-
-❄️- 2023 Day 11 Solutions -❄️-
Fun one :D
-
-❄️- 2023 Day 10 Solutions -❄️-
Way trickier than I was expecting
-
-❄️- 2023 Day 9 Solutions -❄️-
:D
-
-❄️- 2023 Day 8 Solutions -❄️-
Classic LCM
-
-❄️- 2023 Day 7 Solutions -❄️-
Who wants spaghetti?
-
-❄️- 2023 Day 6 Solutions -❄️-
Much easier than yesterday's :D
-
-🎄- 2022 Day 12 Solutions -🎄-
195/242
-
-🎄- 2022 Day 11 Solutions -🎄-
Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning
-
-🎄- 2022 Day 10 Solutions -🎄-
2343 / 2119
-
-🎄- 2022 Day 6 Solutions -🎄-
Impressive how fast everyone was with this one today
What are some alternatives?
Agda - Agda is a dependently typed programming language / interactive theorem prover.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adjunctions - Simple adjunctions
AdventOfCode-Java - adventOfCode(Language.JAVA);
psqueues - Priority Search Queues in three different flavors for Haskell
AoC - my personal repo for the advent of code yearly challenge
distributive - Dual Traversable
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
ethereum-client-haskell
adventofcode - Solutions for problems from AdventOfCode.com
miso - :ramen: A tasty Haskell front-end framework
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA