When searching for graphs of width first and depth first, color the graph. Who colors the chart when the search is complete?

The draft and depth algorithms for traversing diagrams use a flag (or color) to mark nodes as they are visited. For example, some forms of the algorithms use white / gray / black as colors. When the pass is complete, all nodes in the graph are black.

None of the materials I've read about these algorithms mention anything about resetting all nodes to white when traversing is complete.

Are there any additional steps we can add to the algorithms to do this? Or do we have to go through the graph again to reset the color of each node? Or maybe the data structure of the graph is such that changes to the flag / color are temporary and will be lost after the run is complete?