MATLAB implementation of k-shortest arc and vertex disjoint paths algorithms, based on "Finding Arc and Vertex-Disjoint Paths in Networks" by Xie et al. I implemented this for educational purposes - it is documented well, but not optmized. The algorithms were only tested on some small test graphs, use with caution. This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/ or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.