{"id":"https://openalex.org/keywords/breadth-first-traversal","display_name":"breadth-first traversal","description":"A graph or tree traversal method that visits nodes in order of their distance from a starting node, processing neighboring levels successively.","display_name_alternatives":["level-order traversal"],"ids":{"openalex":"https://openalex.org/keywords/breadth-first-traversal","wikidata":"https://www.wikidata.org/wiki/Q325904"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.114,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0812,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":192,"cited_by_count":2161,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/breadth-first-traversal","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
