From d5e626245cc2a96ab9a57b5794878acb110ce20a Mon Sep 17 00:00:00 2001 From: dcoudert Date: Wed, 22 Feb 2023 09:52:37 +0100 Subject: [PATCH] Issue #35168: fix bug --- src/sage/graphs/generic_graph.py | 10 ++++++++-- 1 file changed, 8 insertions(+), 2 deletions(-) diff --git a/src/sage/graphs/generic_graph.py b/src/sage/graphs/generic_graph.py index 38e1f8d5751..6a56a8f955b 100644 --- a/src/sage/graphs/generic_graph.py +++ b/src/sage/graphs/generic_graph.py @@ -4115,12 +4115,18 @@ def is_eulerian(self, path=False): sage: g = Graph({0:[], 1:[], 2:[], 3:[]}); g.is_eulerian() True - """ + Issue :trac:`35168` is fixed:: + + sage: Graph([[0, 42, 'John'], [(42, 0)]]).is_eulerian() + False + sage: Graph([[0, 42, 'John'], [(42, 'John')]]).is_eulerian() + False + """ # unconnected graph can still be Eulerian if all components # up to one doesn't contain any edge nontrivial_components = 0 - for cc in self.connected_components(): + for cc in self.connected_components(sort=False): if len(cc) > 1: nontrivial_components += 1 if nontrivial_components > 1: