Module FunctionDef arguments args defaults body Expr Str Global identifier Assign NameStore Dict For NameStore NameLoad body Assign TupleStore NameStore NameStore TupleLoad SubscriptLoad NameLoad Index Num SubscriptLoad NameLoad Index Num Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call AttributeLoad NameLoad attr NameLoad Num Num Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call AttributeLoad NameLoad attr NameLoad Num Num Assign NameStore ListLoad Assign NameStore Call NameLoad NameLoad While NameLoad body TryExcept body Assign NameStore Call AttributeLoad NameLoad attr Assign NameStore SubscriptLoad NameLoad Index Num Assign NameStore SubscriptLoad NameLoad Index Num Assign NameStore SubscriptLoad NameLoad Index NameLoad TryExcept body If BoolOpOr CompareIn TupleLoad SubscriptLoad NameLoad Index Num NameLoad NameLoad CompareIn TupleLoad NameLoad SubscriptLoad NameLoad Index Num NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad TryExcept body Expr Call AttributeLoad NameLoad attr TupleLoad SubscriptLoad NameLoad Index Num SubscriptLoad NameLoad Index Num AugAssignSub SubscriptStore NameLoad Index SubscriptLoad NameLoad Index Num Num AugAssignSub SubscriptStore NameLoad Index SubscriptLoad NameLoad Index Num Num handlers ExceptHandler type NameLoad body Expr Call AttributeLoad NameLoad attr TupleLoad SubscriptLoad NameLoad Index Num SubscriptLoad NameLoad Index Num AugAssignSub SubscriptStore NameLoad Index SubscriptLoad NameLoad Index Num Num AugAssignSub SubscriptStore NameLoad Index SubscriptLoad NameLoad Index Num Num handlers ExceptHandler type NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad handlers ExceptHandler type NameLoad body Assign NameStore Call NameLoad NameLoad If CompareGt Call NameLoad NameLoad Num body If CompareEq SubscriptLoad NameLoad Index Num SubscriptLoad NameLoad Index Num body Return NameLoad decorator_list FunctionDef arguments args defaults body Expr Str Global identifier Assign NameStore Call NameLoad If NameLoad body Assign NameStore Call NameLoad SubscriptLoad NameLoad Slice Num Assign NameStore Call AttributeLoad NameLoad attr Assign NameStore SubscriptLoad NameLoad Index Num Assign NameStore SubscriptLoad NameLoad Index Num TryExcept body While NameLoad body If BoolOpOr CompareIn NameLoad SubscriptLoad Call NameLoad Call NameLoad NameLoad Index Num CompareIn NameLoad SubscriptLoad Call NameLoad Call NameLoad NameLoad Index Num body Assign NameStore Call NameLoad Assign NameStore Call AttributeLoad NameLoad attr NameLoad Assign NameStore BinOpAdd BinOpAdd BinOpAdd SubscriptLoad NameLoad Slice NameLoad SubscriptLoad NameLoad Slice NameLoad Num SubscriptLoad NameLoad Slice BinOpAdd NameLoad Num SubscriptLoad NameLoad Slice BinOpAdd NameLoad Num If UnaryOpNot NameLoad body Return NameLoad Assign NameStore Call NameLoad SubscriptLoad NameLoad Slice Num Assign NameStore Call AttributeLoad NameLoad attr Assign NameStore SubscriptLoad NameLoad Index Num Assign NameStore SubscriptLoad NameLoad Index Num handlers ExceptHandler type NameLoad body Print Str Expr Call NameLoad orelse Return NameLoad decorator_list Assign NameStore Dict For NameStore NameLoad body Assign TupleStore NameStore NameStore TupleLoad SubscriptLoad NameLoad Index Num SubscriptLoad NameLoad Index Num Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call AttributeLoad NameLoad attr NameLoad Num Num Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call AttributeLoad NameLoad attr NameLoad Num Num Assign NameStore Call AttributeLoad NameLoad attr For NameStore NameLoad body If BinOpMod NameLoad Num body Print Str Expr Call NameLoad Assign NameStore Call NameLoad Print NameLoad
N/A get_a_tour N/A N/A N/A N/A N/A This function returns a possible tour in the current graph and removes the edges included in that tour, from the graph. N/A graph N/A nodes_degree N/A N/A edge graph N/A N/A N/A a b N/A N/A edge N/A 0 N/A edge N/A 1 N/A N/A nodes_degree N/A a N/A N/A N/A nodes_degree get a 0 1 N/A N/A nodes_degree N/A b N/A N/A N/A nodes_degree get b 0 1 N/A tour N/A N/A loop N/A enumerate nodes_degree N/A True N/A N/A N/A N/A l N/A N/A loop __next__ N/A index N/A l N/A 0 N/A node N/A l N/A 1 N/A degree N/A nodes_degree N/A node N/A N/A N/A N/A N/A N/A N/A tour N/A -1 node graph N/A N/A node N/A tour N/A -1 graph N/A N/A N/A N/A tour append node N/A N/A N/A N/A N/A graph remove N/A N/A tour N/A -2 N/A tour N/A -1 N/A N/A nodes_degree N/A N/A tour N/A -1 1 N/A N/A nodes_degree N/A N/A tour N/A -2 1 N/A N/A N/A ValueError N/A N/A N/A N/A graph remove N/A N/A tour N/A -1 N/A tour N/A -2 N/A N/A nodes_degree N/A N/A tour N/A -1 1 N/A N/A nodes_degree N/A N/A tour N/A -2 1 N/A N/A N/A IndexError N/A N/A N/A N/A tour append node N/A N/A N/A StopIteration N/A N/A loop N/A enumerate nodes_degree N/A N/A N/A len tour 2 N/A N/A N/A N/A tour N/A 0 N/A tour N/A -1 N/A N/A tour N/A get_eulerian_tour N/A N/A N/A N/A N/A This function returns a Eulerian Tour for the input graph. N/A graph N/A tour N/A get_a_tour N/A graph N/A N/A loop N/A enumerate N/A tour N/A -1 N/A l N/A N/A loop __next__ N/A i N/A l N/A 0 N/A node N/A l N/A 1 N/A N/A N/A True N/A N/A N/A N/A node N/A N/A list N/A zip graph N/A 0 N/A node N/A N/A list N/A zip graph N/A 1 N/A N/A t N/A get_a_tour N/A j N/A N/A t index node N/A tour N/A N/A N/A N/A tour N/A i N/A t N/A j -1 N/A t N/A N/A j 1 N/A tour N/A N/A i 1 N/A N/A graph N/A N/A tour N/A loop N/A enumerate N/A tour N/A -1 N/A l N/A N/A loop __next__ N/A i N/A l N/A 0 N/A node N/A l N/A 1 N/A N/A N/A StopIteration N/A N/A Your graph doesn't seem to be connected N/A N/A exit N/A N/A tour N/A N/A nodes_degree N/A N/A edge graph N/A N/A N/A a b N/A N/A edge N/A 0 N/A edge N/A 1 N/A N/A nodes_degree N/A a N/A N/A N/A nodes_degree get a 0 1 N/A N/A nodes_degree N/A b N/A N/A N/A nodes_degree get b 0 1 N/A degrees N/A N/A nodes_degree values N/A degree degrees N/A N/A N/A degree 2 N/A N/A Your graph have one or more nodes with odd degrees. Hence an Eulerian Tour is impossible. N/A N/A exit N/A tour N/A get_eulerian_tour N/A tour