@MISC{GLIB_004.MIZ,
  AUTHOR = {Lee, Gilbert and Rudnicki, Piotr},
  NOTE1 = {Part of author's MSc work.},
  TITLE = {Proof of Dijkstra's Shortest Path Algorithm & 
       Prim's Minimum Spanning Tree Algorithm},
  NOTE = {This work has been partially supported by the NSERC,
          Alberta Ingenuity Fund and iCORE.},
  SECTION1 = {Preliminaries},
  SECTION2 = {Dijkstra's Shortest Path Algorithm: definitions},
  SECTION3 = {Dijkstra's Shortest Path Algorithm: theorems},
  SECTION4 = {Prim's Algorithm: preliminaries},
  SECTION5 = {Prim's Minimum Weight Spanning Tree Algorithm: definitions},
  SECTION6 = {Prim's Minimum Weight Spanning Tree Algorithm: theorems },
  DAY = {22},
  MONTH = {February},
  YEAR = {2005},
  ADDRESS1 = {University of Victoria, Victoria, Canada},
  ADDRESS2 = {University of Alberta, 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 manipulations.
             }}
