NZ Level 7 (NZC) Level 2 (NCEA)
topic badge
Moving around a network

Interactive practice questions

A path is:

A sequence of edges joined by vertices where no vertex is repeated (excluding the possibility of the start and end vertex).

A

An edge that connects a vertex to itself.

B

A sequence of edges that start and end at the same vertex.

C

A sequence of edges joined by vertices where no edge is repeated.

D

A sequence of edges joined by vertices where no vertex is repeated (excluding the possibility of the start and end vertex).

A

An edge that connects a vertex to itself.

B

A sequence of edges that start and end at the same vertex.

C

A sequence of edges joined by vertices where no edge is repeated.

D
Easy
Less than a minute
Sign up to try all questions

Which of the following are valid paths?

Which of the following are valid paths?

Which of the following are valid paths?

Outcomes

M7-5

Choose appropriate networks to find optimal solutions

91260

Apply network methods in solving problems

What is Mathspace

About Mathspace