Flashcards
Topological sort shortest path
Cards in this deck (3)
- 1Topological sort order on graphs is...unique in certain cases
- 2Dijkstra's algorithm explores in the same order as...BFS when edge costs are uniform
- 3Which of the following algorithms are greedy?Dijkstra's algorithm
Information
- Description
- Exam Algorithms & Software Concepts (Exam Questions) Flashcards on Topological sort shortest path, created by Finnegan Fischer on 29/04/2021.
- Created by
- Finnegan Fischer
- Views
- 0
- Rating