Part a
Given a directed graph representing a city’s routing network, explain how to determine whether an Eulerian circuit exists by verifying the in-degrees and out-degrees for each vertex. Describe the method for identifying any vertex imbalance.