and /*Initialize to zero flow*/ |

(2) While /*loop until the algorithm terminates in line / |

(3) * *For all nodes , compute in the hopcount to /*by |

* *Breadth-First-Search [28] from / |

(4) * *Compute a blocking flow in thereby skipping links for which |

* * |

(5) * *If exists |

(6) * ** ** * |

(7) * ** ** *Update |

(8) * *else |

(9) * * * ** *return |