Hi,
I am trying to write a simple modified BFS with an alternative stopping condition and want to base it off the single source shortest path implementation provided in the Neo4j Graph Algorithms library: https://github.com/neo4j-contrib/neo4j-graph-...