IB Maths AI 3.12 Definitions
This page contains our IB Maths AI definitions for 3.12. By learning each one of these definitions, you will fully cover the content for IB Maths AI 'Adjacency matrices'.
HL
Adjacency
A way of describing which vertices in a graph are directly connected by an edge.
HL
directed
Having edges with a specified direction, so moving from one vertex to another may be possible without the reverse move being possible.
HL
length
The number of edges used in a walk.
HL
matrices
Rectangular arrays of entries arranged in rows and columns, used to represent and analyse connections in a graph.
HL
probabilities
Numbers between and that measure how likely a move or outcome is, with totals summing to across all possible next states under the stated convention.
HL
walks
Routes through a graph formed by moving along edges from one vertex to another, where vertices and edges may be repeated.
HL
weighted
Describes a graph whose edges have numbers attached to them to represent quantities such as distance, cost, or time.
HL
weights
Numerical values attached to edges to represent quantities such as distance, cost, or time.
Next Up
You have completed the topic 3 definitions for IB Maths AI - continue with related resources below or explore the full IB Maths AI course from the IBO.
Other topic 3 resources