On the point-to-point connection problem

A Dijsktra-like algorithm for solving the point-to-point connection problem on a finite directed network is presented. For this problem the authors find a subset of arcs with minimal total length connecting a fixed number of source-destination pairs. The problem has many variations for different applications. The authors focus on a case where two source-destination pairs are prematched and show that the time complexity of the algorithm O(n⁴) where n is the number of nodes.