Breadth-first search
Breadth-first search is an algorithm for searching the nodes of a graph in order by their hop count from a starting node.
Name
# Contributions
Last Contribution
Find more entities like Breadth-first search
Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
By using this site, you agree to our Terms of Service.