Dado un grafo con etiquetas no negativas, se trata de calcular el coste del camino mı́nimo desde un vértice dado al resto (ing., single-source shortest paths). La utilidad de un procedimiento que solucione esta cuestión es clara: el caso más habitual es disponer de un grafo que represente una distribución geográfica, donde las aristas den el coste (en precio, en distancia o similares) de la cone...

Edsger Wybe Dijkstra, Professor Emeritus in the Department of Computer Sciences at The University of Texas at Austin, died of cancer on 6 August 2002 at his home in Nuenen, the Netherlands. Dijkstra was a towering figure whose scientific contributions permeate major domains of computer science. He was a thinker, scholar, and teacher in renaissance style: working alone or in a close-knit group o...

The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the vertices in order of increasing cost, and maintains a set V of visited vertices (denoted by UsedVx in the article) whose cost from the source has been computed, and a tentative cost D(u) to each unvisited vertex u. In the article, the set of all unvisited vertices is denote...

The ability of mathematical models to represent the lactation process varies according with their structure and database characteristics. aim current study was evaluated goodness fit empirical mechanistic applied dairy sheep curves different shapes. A total 4,494 weekly test day records were analyzed. All lactations individually fitted using two (Wood Wilmink) (Dijkstra, Pollott) models. Dijkst...

Both spaces were introduced and shown to be one-dimensional but totally disconnected by Paul Erdős [9] in 1940. This result together with the obvious fact that E and Ec are homeomorphic to their squares make these spaces important examples in Dimension Theory. Both E and Ec are universal spaces for the class of almost zero-dimensional spaces; see [7, Theorem 4.15]. A subset of a space is called...

Voronoi diagrams are fundamental data structures in computational geometry with several applications on different fields inside and outside computer science. This paper shows a CUDA algorithm to compute Voronoi diagrams on a 2D image where the distance between points cannot be directly computed in the euclidean plane. The proposed method extends an existing Dijkstra-based GPU algorithm to treat...

Introduction Method Results Discussion References Appendix I This article is an English translated version based on Buunk-Werkhoven, Y.A.B.,Dijkstra, A., van der Schans C.P., Jaso, M.E., Acevedo, S., Parodi Estellano, G. (2008). Evaluación y promoción de la actitud hacia la higiene oral en pacientes de la Facultad de Odontología de la Universidad Católica del Uruguay [Evaluation and promotion o...