This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy numbers