1) The depth and breadth-first algorithms in OpenDSA use the data storage feature of a graph to keep track of whether the graph is visited. This is fine as long as you don't have a graph that stores some data (which you can often do in practice). Also, the visited data it accessible outside the traversals, even though it is only used in the traversals. What about information hiding? How can these problems be fixed?