I suppose what you mean is
A---F /|\ / 0 | C H -1 \|/ \ / B G
For any path from 0 to C that includes A it's useless to continue to F.¹
This situation reminds me of the Max-flow min-cut theorem.
IMHO finding all pathes is related to maximizing the flow and the set {C} is a min-cut.
I.a.w. any path from 0 to 1 will be a combination of paths from 0-C and C-1. ²
I'm sure this kind of problem is already extensively investigated in literature.
BTW my initial idea to improve my solution is to start from both ends but I'm reluctant to improve solutions for loosely expressed problems, (normally that results in launching rockets where throwing a stone is efficient and optimal).
Cheers Rolf
UPDATES:
1) i.e. after 0-A-C, 0-B-A-C, 0-A-B-C don't continue to F
2) partitioning into separated subgraphs allows a divide and conquer approach.
In reply to Re: Short Circuiting DFS Graph Traversal
by LanX
in thread Short Circuiting DFS Graph Traversal
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |