Pick a starting node, then walk the knowledge graph one triple at a time — group the neighbours by relationship, drill into a relationship, and step into a connected node to keep going.
Neighbours come from a local gandalf graph queried in-process.
Lists are sorted by node degree (descending) once degrees load; very large
relationships are sampled — see the status line above each list.