Flow, matching and scheduling
Chapter 110 of 23 strong
RESTS ONRead an edge weight and total the length of a stated routeCH 10Identify the network a connection matrix describesCH 8Check whether a listed vertex sequence is a walk on a graphCH 10Classify a valid walk as a trail, path, circuit or cycleCH 10Count the vertices, edges and loops of a displayed graphCH 10Build the connection matrix of a networkCH 8Read a labelled data matrix and its row and column totalsCH 8Multiplication and divisionCH 5Signed numbersFOUNDATIONS
Flow networks
Matching and assignment
Scheduling and critical path analysis