An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)

Preguntas frecuentes Manual de uso Contacto/Sugerencias

Autor

Valdes Valdes, Lissette; Ariza-Quintana, Alfonso; Alonso, Sira; Joya-Caparrós, Gonzalo
Fecha

2019-04-04
Palabras clave

Algoritmos computacionales; Algoritmo de Dijkstra
Resumen

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
URI

https://hdl.handle.net/10630/17478
Compartir

Mostrar el registro completo del ítem

Ficheros

Fuzzy_Dijkstra_algorithm.pdf (223.5Kb)

Colecciones

Informes

Estadísticas

Buscar en Dimension