fgl
aoc2021
fgl | aoc2021 | |
---|---|---|
5 | 23 | |
183 | 3 | |
0.5% | - | |
6.6 | 0.0 | |
20 days ago | over 2 years ago | |
Haskell | Slash | |
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.
aoc2021
- -🎄- 2021 Day 22 Solutions -🎄-
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 17 Solutions -🎄-
- -🎄- 2021 Day 16 Solutions -🎄-
- -🎄- 2021 Day 15 Solutions -🎄-
- -🎄- 2021 Day 14 Solutions -🎄-
- -🎄- 2021 Day 13 Solutions -🎄-
What are some alternatives?
Agda - Agda is a dependently typed programming language / interactive theorem prover.
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adjunctions - Simple adjunctions
AdventOfCode2021 - Advent of code 2021
psqueues - Priority Search Queues in three different flavors for Haskell
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
distributive - Dual Traversable
adventofcode - Advent of Code challenge solutions
ethereum-client-haskell
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
miso - :ramen: A tasty Haskell front-end framework
adventofcode - Advent of code solutions