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
Easy
< 1min

Select the valid walk in this network:

Easy
< 1min

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.

Easy
< 1min
Use the graph to answer the following questions.
Easy
1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

4.2.2.3

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

4.2.2.4

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