What is the shortest path with at most k edges between two points in a given graph?

The shortest path with at most k edges between two points in a graph is known as the k-shortest path. It is the path that has the fewest number of edges while still connecting the two points.