Items-mapping and route optimization in a grocery store using Dijkstra's, Bellman-Ford and Floyd-Warshall Algorithms

Conference Object

Abstract: The study applies three shortest-path-finding algorithms namely Dijkstra's, Bellman-Ford and Floyd-W

Palabras claves:

Bellman-Ford, Dijkstra's, Floyd Warshall, grocery store, item mapping, serverclient based

Autores:

Gregorio G.P.B., Jennifer C. Dela Cruz, Lamoca M.L.L., Magwili G.V., Mundo J.P.E., Villasenor J.A.

Fuentes:

scopus