____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

Related MCQs

• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
• ______________ a tree means processing it in such a way that each node is visited only once.
• A vertex of in-degree zero in a directed graph is called a/an
• If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A graph is a tree if and only if graph is
• A vertex of degree one is called __________.
• 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 the element with a given value is: