COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
in-degree
|
|
|
out-degree
|
|
|
inout-degree
|
|
|
none of above
|
Detailed explanation-1: -Degree(vertex) = The number of edges incident to the vertex(node). In other words, the number of relations a particular node makes with the other nodes in the graph.
Detailed explanation-2: -The degree of a node in an undirected graph is the number of edges incident on it; for directed graphs the indegree of a node is the number of edges leading into that node and its outdegree, the number of edges leading away from it (see also Figures 6.1 and 6.2).
Detailed explanation-3: -The degree of a node is the number of connections that it has to other nodes in the network. In a social network if you have 100 friends then the node that represents you has a degree of 100. Path length is simply the distance between two nodes, measured as the number of edges between them.
Detailed explanation-4: -Outdegree: Total number of leaving vertices is known as outdegree. Indegree: Total number of entering vertices is known as indegree. Total degree: The summation of indegree and outdegree is known as total degree.
Detailed explanation-5: -In-degree of a vertex f = deg(f) = 1. In-degree of a vertex g = deg(g) = 0. Out-degree: Out-degree of a vertex a = deg(a) = 2. Out-degree of a vertex b = deg(b) = 0.