comfortinglyeach algorithm found path of the same length in this casethey found the same path howeverif graph contains more than one shortest path between pair of nodesdfs and bfs will not necessarily find the same shortest path as mentioned abovebfs is convenient way to search for path with the fewest edges because the first time path is foundit is guaranteed to be such path finger exerciseconsider digraph with weighted edges is the first path found by bfs guaranteed to minimize the sum of the weights of the edges