Class Notes (836,587)
Canada (509,861)
CMPT 225 (60)
John Edgar (28)
Lecture

CMPT 225 Week 11 Lecture 3

2 Pages
137 Views
Unlock Document

Department
Computing Science
Course
CMPT 225
Professor
John Edgar
Semester
Summer

Description
Cost of Dijkstra's depends both on size of edge list and size of vertex list More than one variable contributes to running time Also very dependent on data structure used to store priority queue e = # edges v = # vertices Dijk's: Initialize priority queue Process priority queue - remove everything from it for each vertex in pq: remove vertex (do v times) (find edges v times) for each of the vertex's edges:
More Less

Related notes for CMPT 225

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit