If every node u in G is adjacent to every other node v in G, A graph is said to be

Related MCQs

• Consider the following definition in c programming language struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
• A graph is said to be complete if there is no edge between every pair of vertices.
• A graph is said to be complete if there is an edge between every pair of vertices.
• A node is child node if out degree is one.
• Each node in a linear list contains an item called _______ which points to the next node in the list.
• In a ________ linked list, the last node's link field points to the first node of the list.
• The second part of the node, is called _______ field, and contains the address of the next node in the list.
• A ________ linked list is a linked list which always contains a special node, called the header node.
• Select the set of instructions to insert a node pointed by q after a node pointed by p
• Each node in a linear list contains an item called____which points to the next node in the list.