To find the shortest path, you can use a wighted graph and sum the edge of the weights between two vertices.

Question

Quizplus · Accepted Answer

This is true. In a weighted graph, the edge weights represent the cost or distance between two vertices. In order to find the shortest path between two vertices, you need to calculate the sum of the edge weights along the path. This can be done using algorithms such as Dijkstra's algorithm or the Bellman-Ford algorithm.

To Find the Shortest Path, You Can Use a Wighted