Need Help! IN CSES Graph Series in Shortest Route 2 problem

Revision en1, by decrypt_me, 2023-08-13 12:40:02

Need Help! IN CSES Graph Series in Shortest Route 2 problem it is accepting solution of floyd warshall algorithm while O(n*2logn) not (using dijkastra Priority queue).

#

I want to know , when It is benificial to use floyd warshall algorithm and when not ?

Tags cses, graphs, dijkastra, floyd-warshall

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English decrypt_me 2023-08-13 12:40:02 336 Initial revision (published)