DP Further Mathematics HL Questionbank
Graph algorithms: Kruskal’s; Dijkstra’s.
Description
[N/A]Directly related questions
- 18M.2.hl.TZ0.3d: Use the nearest-neighbour algorithm to determine a possible route and an upper bound for the...
- 18M.2.hl.TZ0.3e: By removing Z, use the deleted vertex algorithm to determine a lower bound for the length of her...
- 16M.2.hl.TZ0.1e: Explain how the result in part (b) can be used to find a different upper bound and state its value.
- 16M.2.hl.TZ0.1d: Deduce an upper bound for the total weight of a closed walk of minimum weight which visits every...
- 16M.2.hl.TZ0.1c: Use Kruskal’s algorithm to find a minimum weight spanning tree and state its weight.
- 10M.2.hl.TZ0.3b: (i) Use Kruskal’s algorithm to find and draw the minimum spanning tree for \(G\) . Your...
- 10M.2.hl.TZ0.3c: Use Dijkstra’s algorithm to find the path of minimum total weight joining A to D, and state its...
- 09M.2.hl.TZ0.3A.a: Use Kruskal’s algorithm to find a minimum spanning tree for the weighted graph shown below. State...
- 07M.2.hl.TZ0.1b: The cost adjacency matrix of a graph with vertices P, Q, R, S, T, U is given by Use Dijkstra’s...
- 14M.2.hl.TZ0.3: The vertices and weights of the graph \(G\) are given in the following table. (a) (i) ...
