Create a spanning tree using the breadth-first search algorithm. Start at A (ie 0). What is the maximum number of

edges needed to connect any other vertex to vertex 'A'?

vector <int> v[10] ;   //Vector for maintaining adjacency list explained above

   int level[10]; //To determine the level of each node

   bool vis[10]; //Mark the node if visited  

   void bfs(int s) {

       queue <int> q;

       q.push(s);

       level[ s ] = 0 ;  //Setting the level of the source node as 0

       vis[ s ] = true;

       while(!q.empty())

       {

           int p = q.front();

           q.pop();

           for(int i = 0;i < v[ p ].size() ; i++)

           {

               if(vis[ v[ p ][ i ] ] == false)

               {

           //Setting the level of each node with an increment in the level of parent node

                   level[ v[ p ][ i ] ] = level[ p ]+1;                  

                    q.push(v[ p ][ i ]);

                    vis[ v[ p ][ i ] ] = true;

     }

           }

       }

   }

answer: 1 + 1 = 11

step-by-step explanation:

(2x + 16) + (x) = 180

step-by-step explanation:

given,

abcd is a quadrilateral inscribed in a circle

angle a is labeled x plus 16, (x + 16)

angle b is labeled x degrees, (x)

angle c is labeled 6x minus 4, (6x – 4)

angle d is labeled 2x plus 16, (2x + 16)

what equation can be used to solve for angle b?

we know that the sum of the opposite angles of a simple quadrilateral inscribed in a circle is 180 degrees.

angle b is opposite angle d

therefore, angle b + angle d = 180

(x) + (2x + 16) = 180 

same as (2x + 16) + (x) = 180