How can I find and compute the K-shortest disjoint pair paths between two nodes in a graph?

Question

I want to find and compute the K-shortest pair paths between two nodes in which each pair path contains two paths that they have not any shared links( only source and target