The shortest path in a graph with weighted edges can be found using:A. Depth-first searchB. Breadth-first searchC. Dijkstra's algorithmD. Kruskal's algorithm

The shortest path in a graph with weighted edges can be found using Dijkstra's algorithm.

Here's a step-by-step explanation:

1. Initialize the shortest path from the starting node to all other nodes as infinity, except for the starting node itself, for which the shortest path is 0.

2. Create a set of all the unvisited nodes. Initially, this set is equal to all the nodes of the graph.

3. For the current node, consider all of its unvisited neighbors and calculate their tentative distances. Compare the newly calculated tentative distance to the current assigned value and assign the smaller one.

4. After considering all of the unvisited neighbors of the current node, mark the current node as visited. A visited node will not be checked again.

5. If the destination node has been marked visited, or if the smallest tentative distance among the nodes in the unvisited set is infinity (occurs when there is no connection between the initial node and remaining unvisited nodes), then stop. The algorithm has finished.

6. Otherwise, select the unvisited node that is marked with the smallest tentative distance, and set it as the new "current node". Go back to step 3.

This algorithm is guaranteed to find the shortest path in any graph with non-negative edge path costs, producing a shortest path tree.