Additional Algorithms for Graph Data Science

Neo4j Graph Platform
1

Hi,

I started to develop additional algorithms for GDS. You can see them here: https://github.com/cuneyttyler/semanticspace-neo4j-gds

For now there is only a concurrent version of Dijkstra's Shortest-Path algorithm for multiple source-target pairs. I will update the topic whenever I add new algorithms.

2

This is very interesting additional algorithms.
Will it still be available when GDS version 2.1.0 is released? Or will it be a different jar?

3

Sure, I will upgrade whenever gds and neo4j get upgraded. I'll create different branches/jars for each version.