Given a digraph D = (V; A; `) in which all but one arc (u; v) have
Fantastic news! We've Found the answer you've been seeking!
Question:
Given a digraph D = (V; A; `) in which all but one arc (u; v) have non-negative lengths, describe an algorithm to test whether D has a negative circuit in O (m + n log n) time.
m= |A| and n=|V|
Related Book For
Discrete Mathematics and Its Applications
ISBN: 978-0073383095
7th edition
Authors: Kenneth H. Rosen
Posted Date: