Viewing topic: Breadth First Search

See sub-topics for Breadth First Search ... >> Computer Science >> Algorithm Design >> Breadth First Search

Highest Rated Sign

Video id: #2079 (enlarge)
Post date: 7/18/2012
Posted by: kkp5232
  • Currently 0.0/5 Stars.
  0 ratings
See all signs (1)

Breadth First Search

  • Definition: 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.

    Source: Wikipedia

  • 11:30pm 11/29/2015

    User: edinaclark11

    Post count: 2

    That's interesting and well researched info about nodes Thanks

  • 12:43pm 5/13/2015

    User: reinlessjacklin

    Post count: 368

    Type here...Good way of describing, and good paragraph to obtain information regarding my presentation topic, which I am going to convey in academy. Best Spinning Combo