Waste less time on Facebook — follow Brilliant.

about BFS implementations

We know that BFS is one of most common algorithm in graph theory.It can be done with queue(FIFO). But if problem is about board(like chess boar),we can do it more simply without any queues and other difficulties.Please comment your implementations of BFS whan you are working with board.

Note by Alexander Freeman
3 years, 8 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...