I am trying to implement few graph algorithms in neo4j other than the ones available in the gds, for example like the floyd-warshall, girman-newman, etc. But since it is not available i want to write and run this internally for example with cypher language itself, but this would be complex, at the same time I dont want to use drivers of other languages since i want the performance of this algorithm to depend only on the internal process of neo4j.
Writing a Graph Database Stored Procedure in Neo4j – Part I.
I also have a small project you can use as an example to get going.
Hi @stibuallen2,
If you're comfortable with Java and your algorithms fit into the Pregel framework, you can implement them with our Pregel implementation inside the Graph Data Science library: Pregel API - Neo4j Graph Data Science
Pregel will take care of a lot of heavy lifting in terms of integration with the rest of the library and so on.
Good luck,
Adam