Distance vector routing

Question

Correct or Incorrect:

The count to infinity problem may arise in a distance vector routing protocol even when the network never gets disconnected.

The given answer says that this statement is incorrect. But I think the problem arises even when the weight of link goes up(without the network being disconnected).

As shown in this stackoverflow answer: https://stackoverflow.com/a/13523982/6430403

Comments

count to infinity only arises when a link goes down... so no way to reach a node .. hence distance to that node is infinity.

if the weight of the link goes up then still it would be finite distance ..hence in this case no count to infinity.

---

Even when the link cost increases, we say it as "COUNT TO INFINITY" problem. 

https://www.youtube.com/watch?v=_lAJyA70Z-o

Answer 1

Incase the link goes down , the DVs goes  to infinity . whereas when the link cost raises very high say W.then the DVs go up to the link cost not infinity