0

I have problem where i need to display all nodes which are included in a path(from source to destination), but in such a way that we visit every node in the path only once. Solution with only DFS (and marking visited elements) is not fast enough. Someone told me to use articulation points, but i do not see how to do that. Can you help me?

Thanks.

c0der
  • 18,467
  • 6
  • 33
  • 65
Una3
  • 15
  • 1
  • DFS is a distributed filesystem from Microsoft. Note: for questions about depth-first search, please use the depth-first-search tag. **NOT to be confused** with [depth-first-search] – c0der Apr 23 '20 at 16:25
  • Your question title talks about listing all Hamiltonian paths, but your question body only talks about paths that don't repeat nodes. Can you clarify what you're asking? – templatetypedef Apr 23 '20 at 18:32

0 Answers0