This algorithm systematically explores the edges of a graph to discover every vertex that is reachable from some starting vertex. The algorithm explores the graph by discovering all vertices at distance k from the starting vertex, before discovering any vertices at distance k $+1.$

$$ Binary search

$$ Selection sort

O Kruskal's Minimum Spanning Tree algorithm

O Quicksort

$$ Merge sort

O Dijkstra's Shortest Path algorithm

Depth first search

O Insertion sort

O none of these

O Bubble sort

$$ Bucket sort