Title Thesis Implementation Dijkstra Algorithm At Mie Aceh Store

Dijkstra's algorithm (named after its inventor, a computer scientist, Edsger Dijkstra), is a greedy algorithm used to solve the shortest path problem for a directed graph with side weights ( edge weights) of non-negative value.

For example, if the vertices of a graph symbolize a food stall and the edge weights represent the distance between the shop and the place, Dijkstra's algorithm can be used to find the shortest distance between the shop and the customer's location.

Interface View

Data Menu page

Order Notif Menu Page

Notif Payment Menu page

Supporting Theories

• Information System
• Software Development Life Cycle (SDLC)
• Desain Database
• Unified Modelling Language (UML)
• Framework Aplikasi Web
• Codeigniter
• PHP (Perl Hypertext Preprocessor)
• MYSQL
• HTML (Hypertext Markup Language)
• Cascading Style Sheets (CSS)
• Black Box Testing