2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2.
Posted: Thu Apr 28, 2022 6:29 am
- 2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2 1 (16.47 KiB) Viewed 35 times
the edges are unweighted.
5. Give the Euler circuit of graph G starting from v1 assuming the
edges are undirected and
unweighted. When there is a choice as to which vertex to visit
next, always prefer the
lower-numbered vertex.
2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2.