C++ Program to Traverse a Graph Using BFS (Breadth First Search)

Breadth First Search (BFS) algorithm is used to traverse a graph in a breadthward motion. BFS Algorithm use data structure queue to remember to get the next vertex to start the search and we will requred an array to keep the track of vertex that it is visited or unvisited.

C Program to create a Circular Singly Linked List

In circular singly linked list, the last node of the linked list points to the first node of the linked list that's why it is called circular linked list. In circular linked list we use two pointer head & last, head pointer contain the address of the head node and last pointer contains the address of the last node and last->next points to the head of the Linked list

C Program to insert a node at the beginning and end in a circular singly Linked List

This program shows you how to insert a node at the beginning or at the end of the Linked List. In circular linked list we have two pointer head and last. The head pointer contains address of the head node and the last pointer contain the address of the last node and last->next is pointed to head node.

C Program for deletion of a node from beginning and end of the circular singly Linked List

This program shows you how to insert a node at the beginning or at the end of the Linked List. In circular linked list we have two pointer head and last. The head pointer contains address of the head node and the last pointer contain the address of the last node and last->next is pointed to head node.