fgl VS adventofcode

Your names are good, I reckon it is Martin Erwig's fgl stuff and Andrey Mokhov's algebraic-graphs that you have in mind.

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.

Couple of approaches to graphs that are state-free: functional graphs and algebraic graphs

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".

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.

Code for both parts is here: https://github.com/surgi1/adventofcode/blob/main/2023/day11/script.js

https://github.com/surgi1/adventofcode/blob/main/2023/day8/script.js (both parts, run in browser)

JavaScript

Source is here.

JavaScript, both parts (just for my map shape .o)

JS, ugly and slow.

Live version here, code here.

Vanilla JavaScript / ES6

Already doing that. 94080 for my input.