Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Graphs
Question
Medium
Which algorithm finds the shortest path in an unweighted graph?
A
Dijkstra's
B
Bellman-Ford
C
BFS
D
DFS
Show Answer
← Back to Graphs questions
Which algorithm finds the shortest path in an unweighted graph? | Graphs MCQ | TomoLink | TomoLink
