graph databases and Eulerian path

Question

I am studying graph databases (Neo4J). I know graph databases come from graph theory, which has basis on Euler paper to solve the 7 bridges problem.. eulerian path/eulerian circuit.

I am trying to find an example, something, to show how graph databases use the Eulerian path to solve some problem. Ideally I would need a real example from a source, but even any help to understand this better.. thanks!

Answer 1

I believe you have a misimpression. Even though Euler wrote a paper based on the 7 bridges problem (which was probably the first paper on graph theory), that does not mean that the design of neo4j uses his solution to that specific problem in any way.