COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
u is adjacent to v but v is not adjacent to u
|
|
|
e begins at u and ends at v
|
|
|
u is processor and v is successor
|
|
|
both b and c
|
Detailed explanation-1: -In a graph if e=(u, v) means. u is adjacent to v but v is not adjacent to u. e begins at u and ends at v. u is processor and v is successor.
Detailed explanation-2: -This C program generates graph using Adjacency Matrix Method. A graph G, consists of two sets V and E. V is a finite non-empty set of vertices. E is a set of pairs of vertices, these pairs are called as edges V(G) and E(G) will represent the sets of vertices and edges of graph G.
Detailed explanation-3: -In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
Detailed explanation-4: -A graph can be represented using 3 data structures-adjacency matrix, adjacency list and adjacency set. An adjacency matrix can be thought of as a table with rows and columns. The row labels and column labels represent the nodes of a graph.