- used to find shortest path between two nodes in a graph - similar to breadth-first search but keeps track of visited nodes with priority queue

CS 3.6. (ALEVEL) - Optimisation Algorithm Flashcards by Megan Estrada

{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }

Dijkstra’s Algorithm

used to find shortest path between two nodes in a graph
similar to breadth-first search but keeps track of visited nodes with priority queue

How well did you know this?

Not at all

Perfectly

Application of Dijkstra’s Algorithm

satellite navigation systems
routers (shortest path when routing packets within network)

How well did you know this?

Not at all

Perfectly

CS 3.6. (ALEVEL) - Optimisation Algorithm Flashcards

(2 cards)