A small querry in floyd waeshall

[soumadeepbagui2]

can this algorithm also work for undirected weighted graph

[mr.encoder (Encoder .)]

hey @soumadeepbagui2 , yes it does.

[soumadeepbagui2]

for example if there is a (undirected)edge 1,2 with cost 10 the the matrix[1][2]=matrix[2][1] = 10 right?? for floyd warshall

[soumadeepbagui2]

I am not clear about how floyd warshall work with negative edges as we can say that same for bellman ford can too work with negative cycle if we dont run for again to check the negative cycle detection

[mr.encoder (Encoder .)]

@soumadeepbagui2

for example if there is a (undirected)edge 1,2 with cost 10 the the matrix[1][2]=matrix[2][1] = 10 right?? for floyd warshall

Yes

@soumadeepbagui2

am not clear about how floyd warshall work with negative edges as we can say that same for bellman ford can too work with negative cycle if we dont run for again to check the negative cycle detection

Floyd warshall detects negative cycle + it’s all pair shortest path algo
Bellman ford detects negative cycle + it’s single source shortest path algo

[mr.encoder (Encoder .)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.