A game for learning how to model in graph theory

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/35684

DOI: 10.3390/MATH10121969

ISSN: 2227-7390

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Cordero, A.; Jordan, C.; Murillo Arcila, MarinaAuthority UCA; Sanabria-Codesal, E.
Date
2022
Department
Matemáticas
Source
Mathematics, 10, 1969 2022
Abstract
In this article, we show how to introduce students to modeling while exposing the power of graph theory as a modeling tool. For that purpose, we propose a problem aimed at university students based on a game where the objective is to strengthen the learning of reachability and the shortest path algorithms.
Subjects
modeling; weighted graphs; shortest path algorithms; Dijkstra; Bellman–Ford
Collections