Hi, Everyone:
I wonder whether anyone knows an efficient algorithm
that can find all paths between any two given and
fixed vertices in a directed graph (not counting
cycles). The key here is that I do NOT need to know
all paths between all pair of vertices, but RATHER all
paths between any two GIVEN vertices. Is DFS starting
from one of the vertex the only solution?
Thanks and Happy New Year!
--Min
__________________________________________________
Do You Yahoo!?
Talk to your friends online with Yahoo! Messenger.
http://messenger.yahoo.com
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|