Trivia Forge Play free →

Which graph traversal uses a queue to visit vertices in increasing order of their distance from the source?

Show answer

Breadth-First Search (BFS)

BFS explores the neighbor nodes first before moving to the next level neighbors. It is commonly used to find the shortest path in unweighted graphs.

Would you remember this in 6 months?

Trivia Forge uses spaced repetition so facts stick. Free, no signup needed.

Turn on Algorithms practice →

More Algorithms trivia

Which greedy algorithm finds the Minimum Spanning Tree of a graph by always adding the cheapest edge that does not form a cycle?
Which non-comparison-based sorting algorithm treats elements as sequences of digits to achieve linear-time performance?
Which non-comparison sorting algorithm runs in O(n + k) time for n integers in the range 0 to k?
Which sorting algorithm has an O(n) average-case time complexity by assuming the input is uniformly distributed over the interval [0, 1)?
Which stable divide-and-conquer sorting algorithm recursively divides an input into halves, sorts each half, and then combines the two sorted halves?
Which stable, in-place sorting algorithm with a worst-case complexity of O(n^2) works by repeatedly taking the next element and placing it into its correct position among the already-sorted elements?