Shortest Path is a way of finding the quickest way to get from one place to another. Imagine you have a map with a bunch of dots on it, and you want to get from one dot to another one. To find the Shortest Path, you would try to draw a line that connects the two dots, and make it as short as possible. That line would be the Shortest Path between those two places!