topic badge

4.04 Walks, trails and paths

Interactive practice questions

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

Select the valid walk in this network:

State a closed walk for the graph, starting from $H$H with $3$3 edges.

Enter each vertex as a capital letter, separated by commas.

Use the graph to answer the following questions.

Outcomes

ACMGM083

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

ACMGM084

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

What is Mathspace

About Mathspace