Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-14T07:36:35.907Z Has data issue: false hasContentIssue false
  • English
  • Français

83.19 A teaching note on Dijkstra’s shortest path algorithm*

Published online by Cambridge University Press:  01 August 2016

Ronald Boskovic  and
Paul Belcher
Ronald Boskovic
Affiliation:
United World College of the Atlantic, St Donat's Castle, Llantwit Major, Vale of Glamorgan CF61 1WF
Paul Belcher
Affiliation:
United World College of the Atlantic, St Donat's Castle, Llantwit Major, Vale of Glamorgan CF61 1WF
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Information
The Mathematical Gazette , Volume 83 , Issue 497 , July 1999 , pp. 251 - 254
Copyright
Copyright © The Mathematical Association 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

Something went wrong with the printing of Note 83.03 so it is reprinted here.

References

1. Wilson, R. J. and Watkins, J. J., Graphs, an introductory approach, Wiley (1990).Google Scholar