Terminology
Problem Solving
Shortest Path
Minimum Spanning Tree
100
The lines in a network.
Edges
100
How far is it from Albury and Sydney?
560
100
What is the shortest path in a network?
The path between 2 points with minimum weight.
100
a graph that has numbers on its edges
Weighted Graph
200
What is the degree of vertex B?
3
200
State a route from Albury to Port Macquarie that visits each town without repeating any edges.
A-S-B-BH-PM
200
What is the shortest path from F to C?
F-E-B-C=16
200
Determine the minimum spanning tree of the following:
36
300
What are the towns in the following network?
Vertices
300
Is possible for a delivery to leave and return from the Hill without repeating any edges or vertices?
No
300
What is the short path from the Hill to Shallow End?
12+14=26
300
35
400
How many edges in the following network?
6
400
State a route from the Hill to Shallow End without repeating any edges or vertices.
an edge that goes from a vertex back to itself
H-C-B-E-SH
400
What is the shortest path from Albury to Port Macquarie?
A-S-PM
500
What word describes networks that have the same number of edges and vertices connected in the same way but drawn differently.
Isomorphic
500
State a route to each town, stating and ending at A.
A-F-E-D-C-B-A