If all edges in an undirected connected graph have the same edge$-$weight values

k$,$ you can use either BFS or Dijkstra$$s algorithm to find the shortest path from s to

any other node t$.$