Closed annaritz closed 4 months ago
Instead of querying the k shortest paths, can we instead query the k closest GoProt nodes?
This would be a breadth-first search from the source node, and then collect the paths from the k closest GoProt nodes.
https://neo4j.com/docs/graph-data-science/current/algorithms/bfs/
Instead of querying the k shortest paths, can we instead query the k closest GoProt nodes?
This would be a breadth-first search from the source node, and then collect the paths from the k closest GoProt nodes.