Shortest path in an unweighted graph

What is the Shortest Path in a Graph?
The shortest path means the path between two nodes in a graph that has the smallest possible total weight or cost among all the available paths.