mleku on Nostr: there is loop resolution methods... but they are always problematic when you allow ...

there is loop resolution methods... but they are always problematic when you allow symbolic links, and they are necessary for any kind of graph structured data

i'm not by any means an expert on tree and graph algorithms but this expertise is going to be required and the specifications should at least minimally point at a reference implementation of a walker that knows how to avoid it

pippellia (nprofile…gnh8) recently has been doing a lot of work with social graphs and the same problems exist, and part of the solution he applies is random walks, but specifically locating circles is a step further, the random walk is just one way to avoid them, and there is also the easy one step loops those can easily be avoided