A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

Related Questions

• A graph is a tree if and only if graph is
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• Which data structure is used in breadth first search of a graph to hold nodes?
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
• A vertex of in-degree zero in a directed graph is called a/an
• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• Finding the location of a given item in a collection of items is called ……
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.