Summary: The shortest path problem is a classical network optimisation problem which has wide range of applications in various fields. In this work, we study the task of finding the shortest path in a fuzzy weighted graph (network), i.e., vertices remains crisp, but the edge weights will be of fuzzy numbers. It has been proposed to present new algorithms for finding the shortest path in fuzzy sense where illustrative examples are also included to demonstrate our proposed approach.