Two questions:
Q1- Why do we need to add "bidirectional" arcs (instead of single directional arcs) between the new node n + 1 and with every node in the original network?
Q2- Why is the shortest H-path problem on an n-node network G is equivalent to an (n + 1)-node TSP on network G'?