D1.2 - Algorithms on graphs

The minimum spanning tree Matrix representation for Prim’s algorithm is expected. (minimum connector) problem.; Drawing a network from a given matrix and writing down Prim’s and Kruskal’s algorithm. the matrix associated with a network will be involved.

Use minimum spanning tree to connect the rule to the data and decision in the question.

This matters because minimum spanning tree determines what can be inferred or chosen; begin with the stated conditions and keep the conclusion tied to the evidence.

Example: apply minimum spanning tree to one small, clearly defined case, show the key step or comparison, and explain the result in words.

Boundary: Minimum spanning tree is not a universal recommendation. Check the syllabus scope, assumptions, units and the limits of the evidence before generalising.

Dijkstra’s algorithm for finding the shortest path.

Use dijkstra’s algorithm for finding the shortest path to connect the rule to the data and decision in the question.

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

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

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