Peregrine_Falcon's blog

Introducing new a Competitive Programming blog.
By Peregrine_Falcon, history, 5 years ago, In English

I've started writing a new blog.
The First series of tutorial is about the Breadth-First Search algorithm.
There are 4 parts in this series.
I have discussed tutorial of breadth-first search and printing the shortest path between two nodes.
Bi-Coloring Problem.
Finding the shortest cycle of an unweighted graph.
2D-Grid bfs.
Multiple source bfs.
Passing flow through edges of bfs.
0-1 Breadth-First Search.
How to find the nodes lying in the all possible shortest path between two nodes.
And some other interesting applications of Breadth-First search.
Breadth-First Search. Part 1
Breadth-First Search. Part 2
Breadth-First Search. Part 3
Breadth-First Search. Part 4

I have written another blog about Prime numbers and prime checking.
Prime Numbers and Prime checking

Facebook Page of my blog.
All the article can be found in both English and Bangla.
Please let me know if there are any mistakes.
Finally sorry for my poor English.
Happy Coding.

  • Vote: I like it
  • -16
  • Vote: I do not like it

Comments Comments (9)
| Write comment?
»
5 years ago, # |
  Vote: I like it +10 Vote: I do not like it

This blog sounds like a poem

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

i needed this thank you!

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It' badly needed.THANK YOU :D

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can I ask for a review? If oy can tell me if you can understand it?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      Bro i've started reading.It seems nice to me.I'll let you know finish reading it :D

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
          Vote: I like it +1 Vote: I do not like it

        Hello brother, you asked me about your articles.I've read it throughly and find it amazing.Thanks for providing such a nice article.I hope you will continue this such works and in upcoming days hope you will add more advanced topics in this blog.Thank you.

        → Reply