This is really cool. I'm curious how the OP is calculating the shortest path -- recursive CTEs in Postgres? pgRouting? A graph db?

I recently built an explorer UI for a cultural knowledge graph: https://giraf.app/graph. I used recursive CTEs to find the longest paths through the graph, as a proxy for interestingness. Basically to answer the question: starting from a user post about a book, movie, song, etc., where is it possible to end up?

If the OP might be interested in using the visualization framework I've built, as a way of letting users browse the relationships between photographs, please get in touch.

Congrats again on bringing an awesome project to life!