Let G= (V, E) be a directed a cyclic graph. A Hamiltonian path in G is a
Fantastic news! We've Found the answer you've been seeking!
Question:
Let G= (V, E) be a directed a cyclic graph. A Hamiltonian path in G is a path which visits each vertex of V exactly once. Prove the following property:
G has a Hamiltonian path
if and only if
G has a unique topological ordering.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: