Depth-first search analysis on London Tube network with Neo4j graph algorithms

[bratanic_tomaz]

Graph people – 30 Apr 19

Depth-first search analysis on London Tube network with Neo4j graph algorithms

The Depth-first search algorithm is an algorithm used to search or traverse through the graph. It is a basis for many other graph algorithms but was not directly exposed in Neo4j graph algorithms u…

[neo4j_devrel]

Oooo! Online Meetup??!! 😄 @mark.needham

[greta]

Thanks for submitting!

I've added a tag that allows your blog to be displayed on the community home page!