proof-of-concept integration of RGs makes them available as a Wiki -- find and navigating between them happens through interlinking (not through exhaustive search)
once the RGs are modeled as linked data, they will be added to the Datahub knowledge graph -- nodes in graphs are only reachable if other nodes have connections with them
an "orphan" in linked data/graph theory jargon is a node/entity that doesn't have an connections to anything else -- it is unreachable by traversing nodes along their connections and cannot be found (making orphan nodes rather useless)
TODO
ensure that every RG either links to other RGs or has RGs that link to it (or both; adding inverse links is however not strictly necessary) -- in particular, this is important for RGs on level 2 and even necessary for RGs on level 3
tip: creating a mind-map of which RGs link to which can be useful to keep track (let me know if I should write you a little script which does that; I'll write one anyway which tests for orphans)
background
TODO