A true recursive function to find the top up link in a Papers library

[gino_m]

A few days ago, I was reading:

Dataview JS Getting The Tree Root

After some major headache, and twists and turns, I finally got a version which is able to both pick roots automagically, detect multiple presences of a node in the tree (and avoid re-presenting it), detect loops, and finally to be able to specify which nodes you want to present as root nodes. This latter option does however require for the roots to be within the predefined nodes of the automated search. The only thing missing now, is to get the nodes to collapse, which should be doable by chan…

• which is a bit similar…

If anyone is interested.

(Didn’t try neither. In fact, my Linked Data Vocabularies and Breadcrumbs plugins are also on the back burner. Bookmarked, for now.)