Apply Prim’s algorithm and Kruskal’s algorithm to find the minimum cost-spanning tree in the graph below. 8. Apply Prim’s algorithm and Kruskal’s algorithm to find the minimum cost-spanning tree in the graph below. Answer: Prim’s algorithm: Kruskal’s algorithm:
Prove: Among any [latex]n + 1[/latex] numbers chosen from [latex]1[/latex] to [latex]2n[/latex], at least one pair adds up to [latex]2n + 1[/latex]. July 11, 2025