Java implementation of Bhandari's algorithm (disjoint shortest pair routing)
rweeks/Bhandari
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
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
About
Java implementation of Bhandari's algorithm (disjoint shortest pair routing)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published