Question: 2. (20 pts) Consider the graph below. 11 5 a) Find the minimum spanning tree of the graph using the Kruskal's algorithm. Show each step!

2. (20 pts) Consider the graph below. 11 5 a) Find the minimum spanning tree of the graph using the Kruskal's algorithm. Show each step! Kruskal algoritmasn kullanarak en kk spanning aac bulunuz. Tm admlar gsteriniz. b) Find the shortest paths from vertex 1 to each other vertex using Dijsktra's algorithm. Show each step! Dijsktra algoritmas ile dm 1'den dier tm dmlere en ksa yollar bulunuz
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
