On Sat, 14 Oct 2017, Jori Mantysalo wrote:
Just read Wikipedia page and found the term "traversable". It seems to
be less common than semi-eulerian... But a suggestion based on this:
Let's make four functions
- is_eulerian
- is_traversable
- is_hamiltonian
- is_traceable
Crosslink is_eulerian <-> is_traversable and is_hamiltonian <-> is_traceable.
I did not get any answer to this.
But anyways, I found more. is_eulerian(path=True) will return either False
OR an Eulerian path. This seems to be clearly wrong.
What's more, is_eulerian(path=True) returns True when the graph has an
Eulerian path BUT has not Eulerian cycle. Is this normal use in graph
theory?
--
Jori Mäntysalo
