Mobile Ad-hoc Network (MANET) is a Network in which contains nodes that are dynamic, which means their positions are not fixed or they are can move. Since the positions are not fixed they do not have a permanent infrastructure. So the communication between the mobile nodes should be taken cares of very well for the efficient communication between the nodes. The main challenge that is being faced in the MANET is the dynamicity of the nodes, because of which the positions are changing. The routing between the nodes in the MANET should be based on the current status of the nodes. The routing protocols should adapt in such a way that optimum route between the source and destination is being obtained. The routing task in the MANETs has become very challenging due to the mobility of nodes. The conventional routing strategies for the wired networks cannot be adopted for these highly mobile networks. Geographic routing is one of the efficient routing strategies for routing. Geographic routing has greedy forwarding and recovery forwarding. In this paper the proposal is that among the paths found, the shortest path is being selected using the distance formula.