Question: In a reputable Algorithmic book , it was mentioned that breadth first search is a greedy algorithm. But I searched for it but I found many links that doesn't say so.

My question:
Is breadth first search a **Greedy Algorithm** and why ?

Can you give me a notable reference for your answer ?!

Answer: 
The term "greedy algorithm" refers to algorithms that solve optimization problems.

BFS is not specifically for solving optimization problems, so it doesn't make sense (i.e., it's not even wrong) to say that BFS is a greedy algorithm unless you are *applying* it to an optimization problem. In that case, the statement is true or not depending on how it is applied.

The "reputable algorithm book" probably refers to BFS in the context of a specific optimization problem, and is probably correct to say that it is a greedy algorithm in that context... which you have omitted in your question.
I think there's a confusion here.
Maybe you read BFS Greedy and you think it's Breadth First Search Greedy, but the truth is it's Best First Search Greedy. This is another way to call the usual Greedy algorithm applied to searches.