+**Graph Traversal** is the process of systematically visiting every [node](/wiki/node) (vertex) in a [graph](/wiki/graph) to explore its structure. This exploration allows for operations like searching for specific elements or determining connectivity. Various [algorithms](/wiki/algorithm) dictate the order in which nodes are visited.
+## See also
+- [Depth-first Search](/wiki/depth-first_search)
+- [Breadth-first Search](/wiki/breadth-first_search)
+- [Pathfinding](/wiki/pathfinding)
... 1 more lines