Create an algorithm to determine the shortest route from point A to point B.
Input: Point A - (1,1), Point B - (6,7)
1. Calculate the distances from point A to the four neighboring points (1,2), (1,3), (4,2) and (4,3).  
2.  Find the shortest distance from point A to the neighboring points.  
3.  Now compare the shortest distance from each of the four neighboring points and select the one with the least distance as the shortest route. 
4.  Repeat steps 1-3 till a route from point A to point B is found. 

The shortest route from point A to point B in this example is (1,2), (1,3), (4,2) and (4,3).
Using a graph, the algorithm would start by finding the shortest path from point A to the adjacent node (x,y), which would be (1,0.4) in this example. Then it would find the shortest path from (1,0.4) to the adjacent node (2,1), which would be (1.4,1). The algorithm would keep going until it finds the node (6,7), which would be the shortest path from (1,0.4) to (6,7).