If information like cost is associated to the traversal of an edge, then what is the graph called?

Keep practicing — related questions

• Which of the following graphs has no path and starts and ends at the same vertex?
• Let G = (V,E) be an undirected graph with a subgraph G1 = (V1, E1). Weights are assigned to edges of G as f...
• Let G = (V,E) be an undirected graph with a subgraph G1 = (V1, E1). Weights are assigned to edges of G as f...
• An undirected graph G(V,E) contains n ( n >2 ) nodes named v1 , v2 ,....vn. Two nodes vi , vj are connected...
• If the number of edges are far less than square of modulus of vertex, then what is the graph called?
• In which of the following data structures, for every edge (a, b), there is also an edge (b, a)?
• Nucleus in a cell is surrounded by a jelly-like substance called
• The process of converting data into information in computer terminology is called