Both algorithms use a data structure ... example of both algorithms, assuming that the graph is represented as an adjacency list, and that the goal is to print all the nodes in the order of traversal.