This Week in Neo4j – Analyzing .NET Dependencies, Coloring a Sudoku Graph, Christmas Messages Graph, Making Graph Algorithms ‘Clique’

The NODES 2019 conference featured a series of videos showcasing various applications of graph algorithms and Neo4j. Joe Depeau explained how to apply graph algorithms through classic teen films, while Nathan Smith attempted to solve a Sudoku using the K-1 Coloring Graph Algorithm in Neo4j. Other contributors included Jesús Barrasa analyzing Christmas messages from European heads of state, Mike Solomon exploring Twitter engagement data, and Greg Shackles analyzing .NET dependencies with F# and Neo4j. The conference also highlighted the work of featured community member Michael Porter, who reached the top spot on the Neo4j Ninja leaderboard.