I am currently using the graph-tool
library with Python (3.6) and I just noticed that there is no functionality to extract a Eulerian/Hamiltonian path/circuit. Is there a particular reason for this? I mean I can implement it myself but the point of using this library is to be more efficient than networkx
. So coding it in Python will be a huge slowdown.
Therefore, what should I do to be as efficient as possible here? And also, why is there no implementation of this in graph-tool
?