RT journal article
T1 The STEM methodology and graph theory. Some practical examples
A1 Jordan, C.
A1 Murillo Arcila, Marina
A1 Torregrosa, Juan R.
A2 Matemáticas
K1 weighted graphs
K1 shortest path algorithms
K1 Dijkstra
K1 Bellman–Ford
K1 modeling
K1 STEM
AB In this paper, we highlight that Graph Theory is certainly well suited to an applicationsapproach. One of the basic problems that this theory solves is finding the shortest path betweentwo points. For this purpose, we propose two real-world problems aimed at STEM undergraduatestudents to be solved by using shortest path algorithms from Graph Theory after previous modeling.
PB MDPI
SN 2227-7390
YR 2021
FD 2021
LK http://hdl.handle.net/10498/35663
UL http://hdl.handle.net/10498/35663
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-may-2026