© 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.A* (A-star) is a computer algorithm that is widely used in pathfinding and graph traversal to effectively compute optimal solutions. The algorithm uses the best first search and finds the lowest cost path from a given start node to a target node. It follows a path of the lowest known heuristic cost, keeping a sorted priority queue of alternate path segments along the way. It is more accurate than greedy best-first search algorithm because it takes into account already moved nodes. Each iteration calculates the cost from the starting node and adds the heuristic cost to the target node. The cost of paths can be given based on truth, indeterminate and false membership functions. In the graph, cost path and heuristic cost paths can be expressed with fuzzy numbers. The contribution of this study to the existing literature comes from the usage of A* algorithm to find the shortest path of a graph with arcs expressed in single valued neutrosophic numbers. A numerical example is given to show the usefulness of proposed approach.