(a) Describe an algorithm that will determine a shortest walk from a source node s to a sink node t subject to the additional condition that the walk must visit a specified node p. Will this walk always be a path?
(b) Describe an algorithm for determining a shortest walk from node s to node t that must visit a specified arc (p, q).