- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm ♣
- Decision Making
- Minimax
Algorithms
Machine Learning
Graph Traversal / Dijkstra's Algorithm »
The algorithm finds the shortes paths between nodes. It is used for weighted graphs. It maintains two sets, visited and unvisited vertices.
What is Dijkstra's Algorithm? Is the algorithm used for weighted graphs? What sets is the algorithm using?
Click to Flip Card
