topic badge

9.07 Moving through a network

Interactive practice questions

A path is:

An edge that connects two distinct vertices.

A

A sequence of edges that connect two or more vertices together without reusing a vertex.

B

Any sequence of edges that starts and ends at the same vertex.

C

An edge that connects a vertex to itself.

D
Easy
< 1min

Which of the following are valid paths?

Select all correct answers.

Easy
< 1min

Which of the following are valid paths?

Select all correct answers.

Easy
< 1min

Which of the following are valid paths?

Select all correct answers.

Medium
1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

MS2-12-8

solves problems using networks to model decision-making in practical problems

What is Mathspace

About Mathspace