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
@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 :)
@Adám to not have to bother you everytime i publish a post, can i make prs to the apl.news repo? i guess that's just bothering you in a different way though(:
@RubenVerg (and as per above don't really want to bother you with this but could you add ^?)
i get libva error: vaGetDriverNameByIndex() failed with unknown libva error, driver_name = (null) everytime i start dyalog, also crashes when i run Run from apl.news, idk if they're related
@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
@RubenVerg Not sure what you're asking, but from Windows, simply right click on it in the folder and choose Run with Dyalog. On other platforms, do dyalog LOAD=path/to/apl.news
ah, i ran it with ]link.create, so it seemed weird that it quit and it looked like it crashed, if it was intended to run standalone it makes more sense
