fgl
A Functional Graph Library for Haskell (by haskell)
AdventOfCode2021FSharp
Solutions for Advent of Code 2021 in F# (by oddrationale)
| fgl | AdventOfCode2021FSharp | |
|---|---|---|
| 5 | 17 | |
| 183 | 5 | |
| 0.5% | - | |
| 6.6 | 0.0 | |
| 20 days ago | over 2 years ago | |
| Haskell | Jupyter Notebook | |
| BSD 3-clause "New" or "Revised" License | 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.
fgl
Posts with mentions or reviews of fgl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-10-03.
-
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.
AdventOfCode2021FSharp
Posts with mentions or reviews of AdventOfCode2021FSharp.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-23.
-
Advent of Code day 12 advise
I was having a hard time figuring out day 12 of Advent of Code. In the end I gave up and went looking for some solutions. I came across this one and this one. However, I didn't quite understand what they did.
-
-🎄- 2021 Day 21 Solutions -🎄-
F# solution in Jupyter Notebook. Got some help from this thread.
-
-🎄- 2021 Day 20 Solutions -🎄-
F# solution in Jupyter Notebook. Part 1 takes 500ms but Part 2 takes 24s. Any suggestions on where performance could be improved would be appreciated!
-
-🎄- 2021 Day 18 Solutions -🎄-
F# solution in Jupyter Notebook. Thank God for the Haskell programmers! I would not have been able to solve this without peeking at their some of their code. Parsing the input string was just the first of the challenges! I envy those dynamic programming languages with an eval function.
-
-🎄- 2021 Day 17 Solutions -🎄-
F# solution with Jupyter Notebook. Brute force. I actually solved Part 2 before solving Part 1, unknowingly.
-
-🎄- 2021 Day 16 Solutions -🎄-
F# with Jupyter Notebook. Learned how to use recursive types today! Half-way through the problem I was starting to wonder whether BITS was going to be the new IntCode.
-
[2021 Day 15 (Part 1 & 2)][F#] Why is my implementation of Dijkstra’s Algorithm so slow?
So this year I'm learning F# and functional programming. I could not figure out a immutable solution. So I went with an imperative, mutable solution and did pretty much a straight port from Red Blob Games including using a PriorityQueue.
-
-🎄- 2021 Day 13 Solutions -🎄-
F# with Jupyter Notebook.
-
-🎄- 2021 Day 12 Solutions -🎄-
F# with Jupyter Notebook. Slow but works. I'll probably come back to this day and optimize the solution.
-
-🎄- 2021 Day 11 Solutions -🎄-
F# in Jupyter Notebook. Decided to go with an infinite sequence (generator pattern) for the steps. This made Part 2 a breeze!
What are some alternatives?
When comparing fgl and AdventOfCode2021FSharp you can also consider the following projects:
Agda - Agda is a dependently typed programming language / interactive theorem prover.
aoc - Advent of Code - mscha's Perl 6 solutions
adjunctions - Simple adjunctions
adventofcode
psqueues - Priority Search Queues in three different flavors for Haskell
advent-of-code-2021 - Advent of Code 2021 https://adventofcode.com/2021
distributive - Dual Traversable
advent-of-code - My Advent of Code solutions
ethereum-client-haskell
advent-of-code-kotlin-2021 - Advent of Code 2021 Challenge
miso - :ramen: A tasty Haskell front-end framework
AoC - Advent of Code submissions
fgl vs Agda
AdventOfCode2021FSharp vs aoc
fgl vs adjunctions
AdventOfCode2021FSharp vs adventofcode
fgl vs psqueues
AdventOfCode2021FSharp vs advent-of-code-2021
fgl vs distributive
AdventOfCode2021FSharp vs advent-of-code
fgl vs ethereum-client-haskell
AdventOfCode2021FSharp vs advent-of-code-kotlin-2021
fgl vs miso
AdventOfCode2021FSharp vs AoC