4. Give the strongly-connected components of graph G assuming
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.
2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2.
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
2 V2 V3 5 3 7 V1 6 1 V6 3 4 6 V4 V5 2.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!