D1.3.1 - Algorithm for finding the shortest

Algorithm for finding the shortest Also known as the ‘Chinese postman’ problem.; Students route around a network, travelling will be expected to use inspection to consider all possible along every edge at least once and pairings of odd nodes. ending at the start vertex.; The (The application of Floyd’s algorithm to the odd nodes is network will have up to four odd not required.) nodes.

Use algorithm for finding the shortest to connect the rule to the data and decision in the question.

This matters because algorithm for finding the shortest determines what can be inferred or chosen; begin with the stated conditions and keep the conclusion tied to the evidence.

Example: apply algorithm for finding the shortest to one small, clearly defined case, show the key step or comparison, and explain the result in words.

Boundary: Algorithm for finding the shortest is not a universal recommendation. Check the syllabus scope, assumptions, units and the limits of the evidence before generalising.