Question

Minimum Spanning Trees Networks & Graphs 1. Create a spanning tree using the breadth-first search algorithm. Start at A (i..0) and label cach vertex with the correct number after A and show your path. How many edges were used to create a spanning tree? 2. Create a spanning tree using the breadth-first search algorithm. Start at G (ie. O) and label each vertex with the correct number after A and show your path How many edges were used to create a spanning tree? 3. Create a spanning tree using the breadth-first search algorithm. Start at J (ie. O) and label each vertex with the correct number after J and show your path. How many edges were used to create a spanning tree? Sue Wowwy M M Phoenigh School

Answer 1

anning free using breadth first search tree wing breadt To create spanning algorithm Start at A & required spanning tree. path is ar A E B F C G I J HADL Spanning free is as r were used to Create a spanning free. F IH e ③ spanning tree ir ar G. path is G-ABC HI-JEDT edger were used to create spanning free

start at I volella path is J→F→H→I→G→B→E→C→D→A g edges were used to to create this spanning free. 4 start at A path is A B GDJEH FI