2026-05-28T13:17:32Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/174782026-02-03T11:37:44Zcom_10630_2254col_10630_37960

00925njm 22002777a 4500 dc Valdes Valdes, Lissette author Ariza-Quintana, Alfonso author Alonso, Sira author Joya-Caparrós, Gonzalo author 2019-04-04 This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy numbers https://hdl.handle.net/10630/17478 Algoritmos computacionales Algoritmo de Dijkstra An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)