COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a graph that has a data value labelled on each edge.
|
|
|
The underlying mathematical principles behind the use of graphs.
|
|
|
An object in a graph. Also know as a node (vertices is the plural).
|
|
|
A join (relationship) between two nodes-sometimes called an edge.
|
Detailed explanation-1: -A WEIGHTED EDGE is like a tollway; it costs a certain amount to travel along that edge in either direction. An UNWEIGHTED EDGE, on the other hand, is like a freeway. It costs nothing to travel along that edge. Like Directed and Undirected edges, you cannot mix Weighted and Unweighted Edges.
Detailed explanation-2: -A weighted graph is a graph such that each edge is labeled with a number, called the weight of that edge.
Detailed explanation-3: -The weight of an edge is often referred to as the “cost” of the edge. In applications, the weight may be a measure of the length of a route, the capacity of a line, the energy required to move between locations along a route, etc.
Detailed explanation-4: -Definition: A graph having a weight, or number, associated with each edge. Some algorithms require all weights to be nonnegative, integral, positive, etc. Also known as edge-weighted graph.