asherbhs

don't forget the 2∊⍵ instead of ∨/2=⍵!

oh that can actually be one char shorter: (2|t)⊣@t → (2|t)@t

re golfing: you can change ⍵) (∨/2=⍵) 0[ to ⍵)(2∊⍵)0[ which knocks off a few chars

@xpqz I've thought quite a lot in the past about making something like this. I think sparse matrices may be the path forward with it, that way we could keep some of elegance of the transitive closure idiom ((∨.∧⍨∨⊢)⍣≡) and algorithms like it, without the quadratic complexity

@xpqz Thank you! You can kind of use this representation for graphs. You'd have to store a vector of 'parents' for each node, at which point you have a kind of backwards adjacency list. If I have the opportunity I'd like to make a similar resource for graphs as well :)

I have been working on a tutorial for working with trees, aimed at late-beginner/early-intermediate APLers. hopefully some people here find it helpful! constructive feedback is also appreciated