A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Related Questions

• A vertex of in-degree zero in a directed graph is called a/an
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
• A graph is a tree if and only if graph is
• …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
• 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.
• Which data structure is used in breadth first search of a graph to hold nodes?
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• A ……….. is a graph that has weights of costs associated with its edges.
• A graph in which all vertices have equal degree is known as ____