Diverse or Disjoint K Short Paths

Topics: algorithm
Oct 30, 2010 at 1:27 PM
Hi, first of all thank you very much. That library helped me very much. I have been required to find K short paths that are fully separated-disjoint. The main reason is for network backup. In case one path has a failure some where, We want to route the data to a all separated path, all nodes must be different, Beside the start and the end. After a lot of reading I understand that Suurball's algorithm is doing it. Is there any implementation for that problem? If not can you please add it? I am kind of lost with that problem, too complicated for me to understand. I would appreciate any kind of help. Thanks again.