Graph Searching: Breadth First and Depth First
Wolfram Demonstrations Project · 2007
In a connected graph you can always reach all nodes (or vertices) starting from any given node (called the root) by traversing edges. When traversing an edge from one node to another the first is typically referred to as the parent and the second as the child. Two commonly used graph traversal methods are called breadth first and depth first. ;;