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

Which of the following are valid paths?

Easy
< 1min

Which of the following are valid paths?

Easy
< 1min

Which two of the following are valid paths?

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

Outcomes

MS1-12-8

applies network techniques to solve network problems

What is Mathspace

About Mathspace