K shortest paths and paths through R-specified edges in a protean network

In this paper, the authors consider the case of protean network which is obtained by adding a few nodes and edges to the existing network with the condition that one node of each new edge must belong to the set of new nodes. In such a protean network, they discuss two problems: (i) to determine K shortest paths between a fixed source node to a fixed destination node and (ii) finding all paths through R-specified edges between the source node and the destination node. It is assumed that both the existing network and the expanded network are linear, connected and undirected. Algorithms along with illustrative examples have been presented in each case.