A graph traversal algorithm is a method used to systematically explore or visit all the vertices or nodes of a graph. It defines the order in which the nodes are visited and can be used to perform operations on the nodes, search for specific nodes or paths, or analyze the structure of the graph.