Breadth First Search

                                                 Blog Link:

গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ)

Visualization 

visualgo.net 

ট্রি ডায়ামিটার

Breadth First Search or BFS for a Graph

Breadth First Search (hackerearth)

0-1 BFS

Shakil Ahmed's Blog  

Shakil Ahmed's Blog ( 0-1 BFS) 

                                         Implementation:

complexity: O( nodes + edges).

0-1 BFS 

levelWiseNodeCount 

 SourceToOtherNodeDistance

                            Problem:

Spoj:

1. PPATH - Prime Path 

2. ONEZERO - Ones and zeros 

3. WATER - Water among Cubes 

4. KATHTHI - KATHTHI 

5. NAKANJ - Minimum Knight moves !!! 

Codechef:

1. Chef and Digit Jumps

uva:

1. 10004 - Bicoloring 

2. 336 - A Node Too Far 

3. 567 - Risk 

4. 10653 - Bombs! NO they are Mines!! 

5. 439 - Knight Moves 

6. 762 - We Ship Cheap 

7. 429 - Word Transformation 

LightOj:

1094 - Farthest Nodes in a Tree ( tree Diameter) 

1257 - Farthest Nodes in a Tree (II) (tree diameter) 

 

E-Maxx blog problemlist link

Share: