I am working on a graph problem and want to find some link-disjoint paths between given node pairs. I was wondering if there is an efficient way to achieve this in CP. I checked OR-Tools (routing and network flows sections) but could not model this problem.
I not complete sure what you mean about "link disjoint paths". Does that mean two paths cannot share any edges or that they should not be identical (in which case they are not very diverse)?
If you would like a set of different (short) paths between two nodes, which may have edges in common, you could use a solver for the $K$-shortest path. You can e.g. use Yen's algorithm for that.
If the paths should be completely different (no common edges) then you could solve a series of shortest path problems where in each iteration, you remove the edges used in paths in previous iterations.