dragora@beka_valentine @emilygorcenski Actually, like how specific are you wanting? Because a tree with child pointers and a root pointer would do it, but that's a directed cyclic graph. Directed cyclic graph is too general (it's easy to construct a cycle that hits a small subset of nodes), but I don't know if there's anything more specific.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.