0

A question was asked in the below link, but the answers do not mention which algorithm I can use exactly. I am wondering if the algorithm is based on Dijkstra or traveling salesman problem (TSP) . Find the shortest cycle in a positive weighted directed graph passing through only specific nodes (not the other nodes)

AmirHosein Adavoudi
  • 117
  • 6
  • Neither. You need a modified depth first, or breadth first, search. – ravenspoint Jan 05 '23 at 14:32
  • 1
    This is a duplicate of [Find the shortest cycle in a positive weighted directed graph passing through only specific nodes (not the other nodes)](https://stackoverflow.com/questions/75008053/find-the-shortest-cycle-in-a-positive-weighted-directed-graph-passing-through-on) If you need clarification of the answer, ask on the existing question. – beaker Jan 05 '23 at 16:05
  • "not the other nodes" What does this mean? That visiting the unspecified nodes is forbidden? Or, you do not care if the unspecified nodes are visited or not? – ravenspoint Jan 05 '23 at 18:23

0 Answers0