Abstract: In a supply chain management, road transport plays an important role in getting goods from a point of origin to a point of destination, this research focuses on the principle of graph theory to find the optimal path between two points, the document proposes a Dijkstra algorithm to determine the k shortest paths from a single source node to several destination nodes. So, a program based on Java language is developed in two stages The first stage is simulated on a simple model of routing of the goods with affection of the costs and in the second stage a general algorithm has developed to answer all the models regardless of the number of nodes and link, the program simulation can automatically detect the shortest path related to the minimum cost.