I'm going through recitation 10 where K-connectivity is discussed.
Slide 26 suggest the best solution known: run Ford-Fulkerson on each one of the vertices and check if there are k disjoint paths from the checked vertex to all other vertices (in both directions).
However, in recitation 9 it is mentioned how to check the existence of such paths only between s and t (set the capacities of all edges to 1 and find a maximum flow).
Can you please mention how is that exactly done with other vertices? In other words, how can we verify that there are indeed k disjoint paths from a vertex u to another vertex v?
Thanks in advance.