/C/Bfs

Bfs

 1  procedure BFS(G, root) is
 2      let Q be a queue
 3      label root as discovered
 4      Q.enqueue(root)
 5      while Q is not empty do
 6          v := Q.dequeue()
 7          if v is the goal then
 8              return v
 9          for all edges from v to w in G.adjacentEdges(v) do
10              if w is not labeled as discovered then
11                  label w as discovered
12                  Q.enqueue(w)

Source: en.wikipedia.org

Bfs

1  procedure BFS(G, root) is
 2      let Q be a queue
 3      label root as explored
 4      Q.enqueue(root)
 5      while Q is not empty do
 6          v := Q.dequeue()
 7          if v is the goal then
 8              return v
 9          for all edges from v to w in G.adjacentEdges(v) do
10              if w is not labeled as explored then
11                  label w as explored
12                  Q.enqueue(w)

Source: en.wikipedia.org

Bfs

   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;
      }
            }
        }
    }

Source: hackerearth.com

Similar codes

0 vote111 views1 answer
Example c programming language
C
28 votes197 views2 answers
Link list c
C
0 vote108 views1 answer
How to transform a char to ascii code in c
C
0 vote115 views2 answers
Greatest common divisor iterative
C
0 vote117 views1 answer
Konami code hdl
C
0 vote114 views1 answer
Double array c++
C
1 vote115 views1 answer
Commentaire c
C
8 votes109 views2 answers
Print bool c
C
29 votes161 views1 answer
C challenge
C
0 vote112 views1 answer
Cast from float to long c
C