hard20 pts · first answer countsgraphsgraph-basicseuler-path

Walking every road exactly once

A connected undirected graph of delivery roads has exactly 2 junctions with odd degree. What can you say?

A.An Euler circuit exists that can start at any junctionB.No route can use every road exactly once in this graphC.You would need a Hamiltonian path search to decideD.An Euler path exists, starting and ending at those two junctions

Discussion 0

Join free to post in the discussion.

Walking every road exactly once

Discussion 0

Related questions