Path Finding with Neo4j by Josh Adell.
From the post:
In my previous post I talked about graphing databases (Neo4j in particular) and how they can be applied to certain classes of problems where data may have multiple degrees of separation in their relationships.
The thing that makes graphing databases useful is the ability to find relationship paths from one node to another. There are many algorithms for finding paths efficiently, depending on the use case.
When they say “multiple degrees of separation in their relationships” that sounds a lot like topic maps to me. Or at least topic maps in some use cases I should say.
Enjoy the post and what I anticipate to follow.