This printable worksheet is a good way to get your class to practise using Prim's and Kruskal's algorithms to find the minimum spanning tree for a network. The sheet saves you or your students having to copy down any network or tables and allows you to focus your time on using the algorithms. The worksheet includes using Prim's on a network and on a matrix. Solutions are provided.
Something went wrong, please try again later.
Well designed networks requiring students to reject several edges
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£0.00