MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -A weighted graph or a network is a graph in which a number (the weight) is assigned to each edge. Such weights might represent for example costs, lengths or capacities, depending on the problem at hand.

Detailed explanation-2: -A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers (which are usually taken to be positive).

Detailed explanation-3: -Weighted Graph. A graph G= (V, E) is called a labeled or weighted graph because each edge has a value or weight representing the cost of traversing that edge.

Detailed explanation-4: -Weighted graphs are the graph data structures in which the edges are given some weight or value based on the type of graph we are representing. Unweighted graphs are the graph data structure which are not associated with any weight or value. By default their weight or value is considered as 1.

Detailed explanation-5: -Graph. A graph is a mathematical structure consisting of a set of points called VERTICES and a set (possibly empty) of lines linking some pair of vertices. It is possible for the edges to oriented; i.e. to be directed edges. The lines are called EDGES if they are undirected, and or ARCS if they are directed.