Skip to main content

Breadth First Search Implementation in Java


Breadth First Search Implementation in Java

For Graph Class Design and DFS implementation please refer to below link:-

depth-first-search-implementation-in-java


 
/*


1. Pick a vertex.


2. Get Adjacent Vertex.


3. Insert in queue ( at tail)


4. Remove vertex from queue( head)


5. Do until no vertex left in a queue.




*/ 






void searchBFS()
 {


//this is how we define queue using LinkedList
  Queue<Character> queue=new LinkedList<Character>();
  
  queue.add(vertexlist[0].label);
  
  
 
  
  while(!queue.isEmpty())
  {
  


                 //element at head (Function in main graph class please use above link)
  ArrayList adjvertex=getNeighbours(queue.peek());


  System.out.println(queue.peek());
              //element removed at head


  queue.remove();
 


        if(adjvertex!=null)
  {
  for(int i=0;i<adjvertex.size();i++)
  {
               //element added at tail  
   queue.add((Character) adjvertex.get(i));
  }
  }
  }
  
  
 }

















Labels:






























Comments











Post a Comment































.














Popular posts from this blog

















Deleting a Node by passing data in LInkedList




























 Deleting a Node by passing data in LInkedList:-   The node can be deleted by passing the data value in a function.Here we have three pointers one to traverse the list other to point current node and third one to point previous of current node.      //deleting a given key   public  Node deleteKeyNode ( Node head , int  key )   {    //traverse pointer    Node temp = head ;    //previous pointer    Node prevtemp = temp ;       while ( temp != null )    {     //when key is at head position     if ( key == head . data )     {      head = head . next ;      System . out . println ( "head is deleted" );      return  head ;     }         //when key is at any position other than head     if ( temp . data == key )     {      prevtemp . next = temp . next ;      temp . next = null ;      temp = prevtemp ;      }     prevtemp = temp ;     temp = temp . next ;    }    return  head ;   }     




















Post a Comment









Read more


























Adding Node at the End of Linked List




























  Adding Node at the End of Linked List:-     The method takes two parameter one a head node of a linked list and other data too insert.      public  void  addNodeEnd ( Node head , int  data )   {    if ( head == null )    {     System . out . println ( "list is empty" );     return ;    }   Node node = new  Node ( data );   Node temp = head ;   while ( temp . next != null )   {    temp = temp . next ;   }   temp . next = node ;   }     To Know the basic structure of the linked list click here       




















Post a Comment









Read more