Question

Algorithm Algorithm of BSF 3 =
This algorithm executive q....... Frist search oo q graph g Begining ad....... Node A
Step - 1 initialize all odesh to ready sole (status = 1)
Step - 2 put the starting node a in queue and change it's the waiting state (status = 2)
Step - 3 [Loop] repeat step .4.. And 5 until queue is empty
Step - 4 remove the front node n of queue process and change the status of and do the processed state ( status =3)
Step - 5 add to the rear of the queue all the neighbour of N that are in the ready state ( status = 1 ) and change their status to the waiting state (status)
[ End of step 3 Loop ]
Step - 6 exit
During executive of algorithms each node N of g will be in one of three states called status
Status = 1 (ready state)
Status = 2 (waiting state)
Status = 3 (processed state)
​

Answer 1

Explanation:

Did you mean: Algorithm Algorithm of BSF 3 = This algorithm executive q....... Frist search oo q graph g Beginning at....... Node A Step - 1 initialize all odisha to ready sole (status = 1) Step - 2 put the starting node a in queue and change it's the waiting state (status = 2) Step - 3 [Loop] repeat step .4.. And 5 until queue is empty Step - 4 remove the front node n of queue process and change the status of and do the processed state ( status =3) Step - 5 add to the rear of the queue all the neighbour of N that are in the ready state ( status = 1 ) and change their status to the waiting state (status) [ End of step 3 Loop ] Step - 6 exit During executive of algorithms each node N of g will be in one of three states called status Status = 1 (ready state) Status = 2 (waiting state) Status = 3 (processed state)