RT Report
T1 An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)
A1 Valdes Valdes, Lissette
A1 Ariza-Quintana, Alfonso
A1 Alonso, Sira
A1 Joya-Caparrós, Gonzalo
K1 Algoritmos computacionales
K1 Algoritmo de Dijkstra
AB 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
YR 2019
FD 2019-04-04
LK https://hdl.handle.net/10630/17478
UL https://hdl.handle.net/10630/17478
LA eng
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 20 ene 2026