有效地找到有向图中两个节点之间某个路径上的所有节点

Question

I'm currently trying to figure out an efficient way to find all nodes on some path between two nodes (say, X and Y ) in a directed graph.

My first thought was to run a BFS from X, run a BFS from Y, and take the intersection of visited nodes. Note that I don't need to enumerate all paths between X and Y, just find all nodes that lie on a path from X to Y.

My question is, is there a more optimized way to do this?

Answer 1

Optimization can be done in terms of getting better run-time or using less memory, or finding a good solution (sometimes a local maximum is ok).

You can look at A* search and see if this can be applied to your problem. You would save both memory and shorten the run-time if you can apply this.