Graphical solution to Dijktra’s algorithm using Swing in Java
José Humberto ABRIL-GARCÍA, Aureliano CERÓN-FRANCO, Juan Carlos GRIJALVA-ACUÑA, Nun Pitalúa-Díaz · Journal Mathematical and Quantitative Methods · 2022
The search for new possibilities for graphical user interfaces has turned out to be a very important part of the software, not only for functional reasons or for using the application to fulfill the slogan of an intuitive task, but also because it has been demonstrated at times. Dijkstra's algorithm uses a data structure to store and query partial solutions ordered by distance from the beginning. Development giants spend a lot of resources creating more elegant and intuitive user interfaces for their products, because they have experienced firsthand how useful, well-designed software can sometimes fail when its GUI fails. Dijkstra's algorithm is an algorithm used to determine the shortest trajectory from a certain point to any other point on a graph. In the course of the work, it was possible to generate an application that graphically solves Dijkstra's algorithm. Compatible with Windows, Ubuntu, macOS operating systems using Java programming language. This application serves as a guide to understand concepts related to graph theory and understand how Dijkstra's algorithm works, as well as topics related to object-oriented programming.