Find the shortest path which visits certain vertex set.

qhna
timer Asked: Mar 10th, 2016

Question Description

I have a positive weighted directed graph, there is no self-loop. One node is labelled 'start', one is 'end', and some labelled 'mustpass'. I want to find the  shortest path which pass "mustpass" and contained node only once. 


Please help me to find the best method to get this kind of path. If there is not exit such path, return NA as early as possible. 


User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

This question has not been answered.

Create a free account to get help with this and any other question!

Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors