jrgemignani commented on issue #2349: URL: https://github.com/apache/age/issues/2349#issuecomment-4284348483
@gregfelice If you want to attempt shortest path,... BFS could be good, if the tree isn't too broad. DFS being a problem if it is deep. BFS would need to be built from the ground up, though. DFS is already there - tradeoffs. It would be possible to use the VLE DFS code by setting progressively larger endpoints,... ``` MATCH p=()-[*0..1]->() MATCH p=()-[*1..2]->() MATCH p=()-[*2..3]->() ... MATCH p=()-[*i..n]->() ``` That would allow reusing the VLE code. Just food for thought, though. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
