Understand graph types, planar structure, adjacency matrices and traversal terminology.
Understand graph types, planar structure, adjacency matrices and traversal terminology.
Area of Study 2
Open a heading to see its content focus, source page and related topic practice. These descriptions are paraphrases of the published requirements.
Use graph terminology, connectedness, isomorphism and adjacency matrices.
This topic includes; bullet 1; p. 35Describe planar faces, vertices and edges and apply Euler’s formula.
This topic includes; bullet 2; p. 35Use walks, trails, paths, circuits and cycles in practical connected graphs.
This topic includes; bullet 3; p. 35Solve weighted-network shortest paths by inspection.
This topic includes; bullet 4; p. 35Use greedy methods to solve minimum-spanning-tree applications.
This topic includes; bullet 5; p. 35Outcome 1 retains the study design’s area and topic groups. Outcomes 2 and 3 include skills used across the course. Individual learning targets are concise paraphrases; the source reference identifies the original list. Internal Aspire references are not VCAA codes.
Understand graph types, planar structure, adjacency matrices and traversal terminology.
Understand weighted networks and the shortest-path problem.
Explain trees, minimum spanning trees and greedy selection.
Count a planar graph’s faces, vertices and edges and apply Euler’s relation.
Model traversal problems using trails, paths, circuits, bridges and cycles.
Find a shortest path by inspection in a weighted graph.
Solve minimum-connector problems using trees and greedy methods.
Construct graphs, directed graphs, networks and corresponding matrices for a situation.
Outcomes 2 and 3 develop investigation, modelling and technology skills across the relevant areas.