BFS бойынша тапсырма

Fill in the Blanks

Played 0

Create copy

бос орындарды сәйкес келетін сөздермен толтырыңыз

Шұғыла Бердімұрат

Kazakhstan

There are still no results for this game. Be the first to stay in the ranking! Log in to identify yourself.

Make your own free game from our game creator

Compete against your friends to see who gets the best score in this game

Make challenge


Fill in the Blanks BFS бойынша тапсырмаOnline version бос орындарды сәйкес келетін сөздермен толтырыңыз by Шұғыла Бердімұрат 1 #include #include MAX 20 int queue [ ] ; int front = - 1 , = - 1 ; void enqueue ( value ) { + + ; queue [ rear ] = value ; if ( front = = - 1 ) front = 0 ; } int dequeue ( ) { value = queue [ front ] ; front + + ; return value ; } bool isEmpty ( ) { if ( front = = - 1 \| \| front > rear ) return ; return ; } void BFS ( int [ MAX ] [ MAX ] , int n , int start ) { int visited [ MAX ] ; ( int i = 0 ; i < n ; i + + ) { visited [ i ] = 0 ; } enqueue ( start ) ; visited [ start ] = 1 ; ( ! isEmpty ( ) ) { int current = dequeue ( ) ; printf ( " %d " , current ) ; for ( int i = 0 ; i < n ; i + + ) { if ( graph [ current ] [ i ] = = 1 && visited [ i ] = = 0 ) { enqueue ( i ) ; visited [ i ] = 1 ; } } } } int main ( ) { int n ; int start ; int graph [ MAX ] [ MAX ] ; / / ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? for ( int i = 0 ; i < ; i + + ) { for ( int j = 0 ; j < n ; j + + ) { scanf ( " " , &graph [ i ] [ j ] ) ; } } scanf ( " %d " , &start ) ; BFS ( graph , n , start ) ; 0 ; }