Select the valid walk in this network:

$E,D,C,B,A$`E`,`D`,`C`,`B`,`A`

A

$A,B,E,C,D$`A`,`B`,`E`,`C`,`D`

B

$C,D,A,E,D$`C`,`D`,`A`,`E`,`D`

C

$B,C,D,B,A$`B`,`C`,`D`,`B`,`A`

D

$E,D,C,B,A$`E`,`D`,`C`,`B`,`A`

A

$A,B,E,C,D$`A`,`B`,`E`,`C`,`D`

B

$C,D,A,E,D$`C`,`D`,`A`,`E`,`D`

C

$B,C,D,B,A$`B`,`C`,`D`,`B`,`A`

D

Easy

Less than a minute

Sign up to try all questions

explain the meaning of the terms: walk, trail, path, closed walk, closed trail, cycle, connected graph, and bridge

investigate and solve practical problems to determine the shortest path between two vertices in a weighted graph (by trial-and-error methods only)