Breadth First Traversal

Algorithm Description
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. - Wikipedia


Generator Input Format
Upload an XML File that follows this format



You must be logged in to request a generation!
Locations of visitors to this page