Question: true or false give a short explanation (please only answer the english part of the question) i. Let Tbe a tree constructed by Dijkstra's algorithm
true or false give a short explanation (please only answer the english part of the question)

i. Let Tbe a tree constructed by Dijkstra's algorithm for a weighted connected graph G. T is a spanning tree of G? T, arlkl balantl bir grafik G iin Dijkstra'nn algoritmas tarafndan oluturulan bir aa olsun. T, G'nin kapsaml aac mdr
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
