meetup

In this talk Mark Needham explains graph algorithms that provide one of the most potent approaches to analysing connected data. They describe steps to be taken to process a graph to discover its general or specific quantities. In this talk we will introduce you to the Neo4j Graph Algorithms library, giving a brief overview of the different types of algorithms available, and where you might use them. We will also show you how to get set up with the Graph Algorithms library, as well as introducing you to NEuler, the Cypher-free graph algorithms playground.

Resources

Noe4j Documentation Graph Data Science sandbox : Neo4j Sandbox - Get started quickly, no download required.
Graph Database Use Cases : Graph Database Use Cases and Solutions PPT : Mark Intro to Graph Data Science.pdf - Google Drive