W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21474Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Lee, Gilbert | - |
| dc.contributor.author | Rudnicki, Piotr | - |
| dc.date.accessioned | 2026-11-09T12:38:21Z | - |
| dc.date.available | 2026-11-09T12:38:21Z | - |
| dc.date.issued | 2005 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 13, Issue 2, Pages 295-304 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/21474 | - |
| dc.description.abstract | We prove correctness for Dijkstra’s shortest path algorithm and Prim’s minimum weight spanning tree algorithm at the level of graph manipulations. | pl |
| dc.language.iso | en | pl |
| dc.publisher | University of Białystok | pl |
| dc.rights | CC BY-SA 4.0 | - |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | - |
| dc.title | Correctness of Dijkstra’s Shortest Path and Prim’s Minimum Spanning Tree Algorithms | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2005 University of Białystok | pl |
| dc.rights.holder | This work is licensed under the Creative Commons License. | pl |
| dc.description.Affiliation | Gilbert Lee - University of Victoria, Victoria, Canada | pl |
| dc.description.Affiliation | Piotr Rudnicki - University of Alberta, Edmonton, Canada | pl |
| dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990. | pl |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | pl |
| dc.description.references | Czesław Byliński. A classical first order language. Formalized Mathematics, 1(4):669–676, 1990. | pl |
| dc.description.references | Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990. | pl |
| dc.description.references | Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521–527, 1990. | pl |
| dc.description.references | Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990. | pl |
| dc.description.references | Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990. | pl |
| dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990. | pl |
| dc.description.references | Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35–40, 1990. | pl |
| dc.description.references | Jarosław Kotowicz. Real sequences and basic operations on them. Formalized Mathematics, 1(2):269–272, 1990. | pl |
| dc.description.references | Gilbert Lee. Trees and Graph Components. Formalized Mathematics, 13(2):271–277, 2005. | pl |
| dc.description.references | Gilbert Lee. Walks in Graphs. Formalized Mathematics, 13(2):253–269, 2005. | pl |
| dc.description.references | Gilbert Lee. Weighted and Labeled Graphs. Formalized Mathematics, 13(2):279–293, 2005. | pl |
| dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005. | pl |
| dc.description.references | Piotr Rudnicki. Little Bezout theorem (factor theorem). Formalized Mathematics, 12(1):49–58, 2004. | pl |
| dc.description.references | Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335–338, 1997. | pl |
| dc.description.references | Piotr Rudnicki and Andrzej Trybulec. Multivariate polynomials with arbitrary number of variables. Formalized Mathematics, 9(1):95–110, 2001. | pl |
| dc.description.references | Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics. | pl |
| dc.description.references | Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115–122, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25–34, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9–11, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15–22, 1993. | pl |
| dc.description.references | Andrzej Trybulec and Czesław Byliński. Some properties of real numbers. Formalized Mathematics, 1(3):445–449, 1990. | pl |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990. | pl |
| dc.description.references | Josef Urban. Basic facts about inaccessible and measurable cardinals. Formalized Mathematics, 9(2):323–329, 2001. | pl |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990. | pl |
| dc.description.volume | 13 | pl |
| dc.description.issue | 2 | pl |
| dc.description.firstpage | 295 | pl |
| dc.description.lastpage | 304 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2005, Volume 13, Issue 2 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Correctness_of_Dijkstra’s_Shortest_Path.pdf | 119,98 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
