COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
length
|
|
|
width
|
|
|
height
|
|
|
none of above
|
Detailed explanation-1: -The number of edges appearing in the sequence of a path is called the length of path. Cycle or Circuit: A path which originates and ends in the same node is called a cycle of circuit. A path is said to be simple if all the edges in the path are distinct.
Detailed explanation-2: -length: the number of edges appearing in the sequence of a path.
Detailed explanation-3: -I’d probably call this the “Edge-cardinality” of the graph, and it’s denoted |E|, where your graph G=(V, E). Similarly, the “vertex-cardinality” is the number of vertices, denoted |V|, though |G| is sometimes also used to denote |V|.
Detailed explanation-4: -Path length is simply the distance between two nodes, measured as the number of edges between them.
Detailed explanation-5: -The number of edges incident on a vertex is the degree of the vertex.