Correctness of Dijkstra’s Shortest Path and Prim’s Minimum Spanning Tree Algorithms 1.pdf

FORMALIZED MATHEMATICS Volume 13, Number 2, Pages 295–304 University of Bialystok, 2005 Correctness of Dijkstra’s Shortest Path and Prim’s Minimum Spanning Tree Algorithms1 Gilbert Lee2 Piotr Rudnicki University of Victoria University of Alberta Victoria, Canada Edmonton, Canada Summary. We prove correctness for Dijkstra’s shortest path algorithm and Prim’s minimum weight spanning tree algorithm at the level of graph ma nipulations. MML identifier: GLIB 004, version: 7.5.01 4.39.921 The notation and terminology used in this paper are introduced in the following articles: [25], [11], [24], [22], [28], [23], [13], [30], [10], [7], [4], [6], [14], [1], [26], [29], [8], [3], [27], [21], [19], [12], [2], [5], [9], [18], [16], [15], [20], and [17]. 1. Preliminaries One can prove the following propositions: (1) For all functions f , g holds support(f+g) ⊆ support f ∪ support g. . (2) For every function f and for all sets x, y holds support(f+(x−→y)) ⊆ support f ∪ {x}. (3) Let A, B be sets, b be a real bag over A, b1 be a real bag over B, and b2 be a real bag over A \ B. If b = b +b , then b = b + b . 1 2 1 2 (4) For all sets X , x and for every real bag b over X such that dom b = {x} holds b = b(x). 1This work has been partially supported by NSERC, Alberta Ingenuity Fund and iCORE. 2Part of author’s MSc work. c 2005 University of Bialystok