(Q325904)

English

breadth-first search

algorithm for searching the nodes of a graph in order by their hop count from a starting node

  • BFS
  • breadth first search

Statements

Breadth-first-tree.svg
390 × 250; 2 KB
Order in which the nodes are expanded (English)
Ordre dans lequel les nœuds sont parcourus (French)
Ordning i vilken noderna expanderas (Swedish)
Rækkefølge, hvori knudepunkterne udvides (Danish)
Animering (Swedish)
Animation (Danish)
Animation (English)
0 references
BFS (English)
0 references
1945
0 references
0 references
0 references
Breadth-first search
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit