Pages in this set

Page 1

Page 2

DECISION MATHS 1 CHECK LIST

Bipartite Graphs

Dijkstra's algorithm
Notes: Remember to put squares around final numbers and write down each step that you are doing
(this will help the examiner mark your work). Marks will be awarded for the correct lowest `weight'
on each vertex and for the correct…

Pages in this set

Page 1

Page 2

DECISION MATHS 1 CHECK LIST

Bipartite Graphs

Dijkstra's algorithm
Notes: Remember to put squares around final numbers and write down each step that you are doing
(this will help the examiner mark your work). Marks will be awarded for the correct lowest `weight'
on each vertex and for the correct…