Our great sponsors
| aoc | fgl | |
|---|---|---|
| 14 | 5 | |
| 3 | 183 | |
| - | 1.1% | |
| 7.1 | 6.6 | |
| 4 months ago | 12 days ago | |
| Python | Haskell | |
| - | 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.
aoc
- -🎄- 2021 Day 13 Solutions -🎄-
-
-🎄- 2021 Day 12 Solutions -🎄-
Now it runs in 0.3 milliseconds! See: https://github.com/c-kk/aoc/blob/master/2021-go/day12-dfs/solve.go
- -🎄- 2021 Day 11 Solutions -🎄-
- -🎄- 2021 Day 10 Solutions -🎄-
- -🎄- 2021 Day 9 Solutions -🎄-
-
-🎄- 2021 Day 8 Solutions -🎄-
Solution: https://github.com/c-kk/aoc/blob/master/2021-go/day08/solve.go
- -🎄- 2021 Day 7 Solutions -🎄-
- -🎄- 2021 Day 6 Solutions -🎄-
- -🎄- 2021 Day 5 Solutions -🎄-
- -🎄- 2021 Day 4 Solutions -🎄-
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.
What are some alternatives?
rockstar - The Rockstar programming language specification
Agda - Agda is a dependently typed programming language / interactive theorem prover.
perlweeklychallenge-club - Knowledge base for The Weekly Challenge club members using Perl, Raku, Ada, APL, Awk, Bash, BASIC, Bc, Befunge-93, Bourne Shell, BQN, Brainfuck, C3, C, CESIL, C++, C#, Clojure, COBOL, Coconut, Crystal, D, Dart, Dc, Elm, Emacs Lisp, Erlang, Excel VBA, Fennel, Fish, Forth, Fortran, Gembase, GNAT, Go, Haskell, Haxe, HTML, Idris, IO, J, Janet, Java, JavaScript, Julia, Kotlin, Lisp, Lua, M4, Miranda, Modula 3, MMIX, Mumps, Myrddin, Nim, Nix, Node.js, Nuweb, OCaml, Odin, Ook, Pascal, PHP, Python, Postscript, Prolog, R, Ring, Ruby, Rust, Scala, Scheme, Sed, Smalltalk, SQL, Swift, Tcl, TypeScript, Visual BASIC, WebAssembly, Wolfram, XSLT and Zig.
adjunctions - Simple adjunctions
advent-of-code - Advent of code solutions
psqueues - Priority Search Queues in three different flavors for Haskell
advent-of-code - My solutions to Advent of Code
distributive - Dual Traversable
aoc - My solutions to adventofcode.com
ethereum-client-haskell
aoc-2021-fsharp - My F# solutions for Advent of Code 2021 https://adventofcode.com/2021
miso - :ramen: A tasty Haskell front-end framework