Join GitHub today
GitHub is home to over 31 million developers working together to host and review code, manage projects, and build software together.Sign up
Java implementation of Bhandari's algorithm (disjoint shortest pair routing) http://newbrightidea.com
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Type||Name||Latest commit message||Commit time|
|Failed to load latest commit information.|
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