Modify the Floyd-Warshall algorithm to detect whether graph G has a cycle of weight w < 0.
No answer yet for this question.
Ask a Tutor
Question:
Modify the Floyd-Warshall algorithm to detect whether graph G has a cycle of weight w < 0. Explain the correctness of your algorithm.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: