Which graph traversal visits a node, then a neighbor of the node, a neighbor of the neighbor, and so on, advancing as far as possible from the original node?
a) Depth-first search
b) Breadth-first search
c) Dijkstra's algorithm
d) Prim's algorithm