Bellmann Ford algo

Question

Self doubt:-

Since we know in bellmann Ford algorithm we iterate n-1 time to find the shortest path and iterate 1 more time  to tell whether -ve cycle exists or not...

My doubt is can we get different value of dist[V_n] for the same iteration { for ex can we get different dist[V_n] for 1st iteration}

{ dist is an array containing the shortest path of vertex V_n to source S}

Comments

@Rohit Pandey, I didn't get your question. What do you mean by different dist[V_n] for same iteration ? Are you trying to asking that each array elements dist[v1], dist[v2] .... will get different values for same iteration ? if yes, then i think it is possible to get different values for same iteration