THE DETERMINATION OF THE OPTIMAL PATHS WITH MINIMUM MULTIPLICATION IN UNDIRECTED GRAPH THAT HAVE THE VALUE OF THE EDGES OBTAINED FROM THE DIJKSTRA ALGORITHM
Paul Vasiliu · 2012
By defining the optimal path with minimum value in a finite undirected graph, with positive value for edgess, we usually understand the determination of the path for which the amount of the edges values that compose the path is minimum. This problem is solved by classics algorithms, but the most efficient from all is Dijkstra algorithm. In this paper we will define the concept of optimal path of minimum value as a result of the multiplication of the edges values that compose that path in a finite undirected graph, we will prove how these paths can be obtained, we will introduce an adaptation of the Dijkstra algorithm and finally, an implementation in C language. Keywords: undirected graph, Dijkstra algorithm, multiplication