To warm up a comments section in this blog I can start with an answer for the task :) A, C and D nodes have a degree of 3 B node has a degree of 5 So shortly - we can't do the mentioned walk through the city. We could, if f.e. one B-D bridge would be changed to A-D, this would create two odd degree nodes and two even degree nodes, allowing the walk