One of the consequences of Seymour's characterization of regular matroids is the existence of a polynomial time recognition algorithm for totally unimodular matrices (i.e. matrices for which every square sub-determinant is in {0, 1, -1}).


But has anyone actually implemented it?



Has anyone implemented a recognition algorithm for totally unimodular matrices?
**EDIT.** Walter and Trümper have [announced on arXiv](https://arxiv.org/abs/1202.4061) their implementation, with source code available, of two methods for testing total unimodularity. Their paper describes the technical details of the implementation / algorithm, and also provides several experimental results.




---


I found the following link for an implementation in R, where they claim to have a function for testing whether a matrix is totally unimodular. I have not checked which particular algorithm they use.


Link: [R package](https://cran.r-project.org/web/packages/deducorrect/deducorrect.pdf)


