MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In a unidirectional graph the connections between nodes can be traversed in both directions. If the arcs are all one way, the the graph is called a
A
Digraph
B
One way graph
C
Unigraph
D
Epigraph
Explanation: 

Detailed explanation-1: -Definition (digraph): A digraph is an ordered pair of sets G = (V, A), where V is a set of vertices and A is a set of ordered pairs (called arcs) of vertices of V.

Detailed explanation-2: -Graph Traversal Algorithm. The process of visiting or updating each vertex in a graph is known as graph traversal. The sequence in which they visit the vertices is used to classify such traversals. Graph traversal is a subset of tree traversal.

Detailed explanation-3: -There are 2 different types of digraphs: heterogeneous digraphs and homogeneous digraphs.

Detailed explanation-4: -A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal).

There is 1 question to complete.
Previous
Next