BEST theorem provides a polynomial-time algorithm for enumeration of Eulerian trails in a given directed graph. Is there is a readily available implementation of it in Sage?
Revision history [back]
 | 1 | initial version |  |
Implementation of BEST theorem
| | 2 | None |
Implementation of BEST theorem
BEST theorem provides a polynomial-time algorithm for enumeration of Eulerian trails circuits in a given directed graph. Is there is a readily available implementation of it in Sage?
