A game for learning how to model in graph theory

dc.contributor.author	Cordero, A.
dc.contributor.author	Jordan, C.
dc.contributor.author	Murillo Arcila, Marina
dc.contributor.author	Sanabria-Codesal, E.
dc.contributor.other	Matemáticas	es_ES
dc.date.accessioned	2025-02-27T13:00:03Z
dc.date.available	2025-02-27T13:00:03Z
dc.date.issued	2022
dc.identifier.issn	2227-7390
dc.identifier.uri	http://hdl.handle.net/10498/35684
dc.description.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.	es_ES
dc.format	application/pdf	es_ES
dc.language.iso	eng	es_ES
dc.publisher	MDPI	es_ES
dc.source	Mathematics, 10, 1969 2022	es_ES
dc.subject	modeling	es_ES
dc.subject	weighted graphs	es_ES
dc.subject	shortest path algorithms	es_ES
dc.subject	Dijkstra	es_ES
dc.subject	Bellman–Ford	es_ES
dc.title	A game for learning how to model in graph theory	es_ES
dc.type	journal article	es_ES
dc.rights.accessRights	open access	es_ES
dc.identifier.doi	10.3390/MATH10121969
dc.type.hasVersion	VoR	es_ES