query: Python code to find Eulerian Tour does not work in one case. Why?
positive_passages.docid: 147275
positive_passages.text: Finding a Eulerian Tour
negative_passages.docid: 4599
negative_passages.text: Scripting a propeller or gear ; the info window python code fails to match success of GUI duplicate and rotate applied to master gear or blade
negative_passages.docid: 29531
negative_passages.text: A Question On Euler's Proof Of the Basel Problem
negative_passages.docid: 145835
negative_passages.text: Closed form for CRT solution using Euler $\phi\,$ (totient)
negative_passages.docid: 121365
negative_passages.text: Why results of map() and list comprehension are different?
negative_passages.docid: 92205
negative_passages.text: Does Euler formula work for complex $z$?
negative_passages.docid: 142931
negative_passages.text: Problem on Euler's Phi function
negative_passages.docid: 27782
negative_passages.text: Why does this proof of the chain rule not work?
negative_passages.docid: 61258
negative_passages.text: Using OddQ and EvenQ in piecewise functions: Buggy?
negative_passages.docid: 158262
negative_passages.text: Why do Numpy.all() and any() give wrong results if you use generator expressions?
negative_passages.docid: 151655
negative_passages.text: Why does Mathematica give no output?
negative_passages.docid: 109932
negative_passages.text: When does the Newton Raphson method fail?
negative_passages.docid: 38547
negative_passages.text: Why does the Euclidean algorithm for finding GCD work?
negative_passages.docid: 76374
negative_passages.text: NDSolve with Euler method
negative_passages.docid: 17980
negative_passages.text: How do you find the iterator in the middle of two iterators?
negative_passages.docid: 45149
negative_passages.text: If range() is a generator in Python 3.3, why can I not call next() on a range?
negative_passages.docid: 45958
negative_passages.text: Proof that the Euler characteristic is additive