9. Networks

9.01 Language of networks

9.02 Network representations

Investigation: Stellar networks

9.03 Degree and adjacency

9.04 Parts of networks

9.05 Spanning trees

9.06 Minimal spanning tree algorithms

9.07 Moving through a network

9.08 Planning activities with dependencies

9.09 Forward and backward scanning

9.10 Critical path analysis

9.11 Flow networks

Year 12

9.03 Degree and adjacency

Interactive practice questions

Consider this network:

a

What is the degree of vertex $C$C?

b

What is the degree of vertex $D$D?

Easy

< 1min

Consider this network:

Easy

< 1min

Fill in the adjacency matrix for this network:

Easy

< 1min

Fill in the adjacency matrix for this network:

Easy

1min

Outcomes

MS2-12-8

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

What is Mathspace

About Mathspace