Skip to content
Java implementation of Bhandari's algorithm (disjoint shortest pair routing)
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
src
test/bhandari
README

README

This project contains an implementation of Bhandari's Algorithm for
edge-disjoint shortest pair routing. 

Based on the book:
Survivable Networks: Algorithms for Diverse Routing
Ramesh Bhandari
ISBN: 0-7923-8381-8

All work in this project is licensed under the GNU Lesser General Public License,
which is available here:

http://www.gnu.org/licenses/lgpl-3.0.txt

You can’t perform that action at this time.