René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"link (esp. org-roam) support","articleBody":"Files can link to other files. There are a few syntaxes for it; the one I use is org-roam's. \r\n\r\nI understand tree-query can execute searches like \"Show me any node containing X with a descendent containing Y, or vice-versa\" (because [I asked about it on Twitter](https://twitter.com/carelogic/status/1418660972122804228)). That's cool -- but what would be *really* cool is if it could also recursively search the files linked to in a subtree.\r\n\r\nAdmittedly, this generalization makes the problem space more complex, because links permit circular structures -- every digraph is a tree but not every tree is a digraph. The search engine would need to remember which files it has searched, so that it does not search them again and infinite regress.","author":{"url":"https://github.com/JeffreyBenjaminBrown","@type":"Person","name":"JeffreyBenjaminBrown"},"datePublished":"2022-12-18T18:22:11.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/4/tree-query/issues/4"}