Breadth First Search
# Breadth First Search
# Graph Traversal
Assuming ties are handled in alphabetical order
Expansion Order: A > B > C > D > E > G Final Path: A > C > G
Search
Assuming ties are handled in alphabetical order
Expansion Order: A > B > C > D > E > G Final Path: A > C > G