At page 7 from these slides there is a Greedy algorithm I want to implement.
let $P_i$ be the shortest path (if one exists) that [...]
connects some ($s_j$, $t_j$) pair that is not yet connected.
$(s_j,t_j)$ comes from a set of commodities.
Without getting into the theoretical implication of the whole algorithm, I only wonder how to implement such a statement.
It is stated to be greedy, hence it should have an easy implementation.
Is there a standard way to do that?
EDIT: Is there also any better reference than slides?