Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official. ×

Marine7's blog

By Marine7, history, 8 months ago, In English,

Greetings.

As we know, inside a SCT, there exists a Hamiltonian path, starting from each node.

What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?

 
 
 
 

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

As far as I remember, it suffices to build a path greedily, choosing always a vertex with smallest indegree from those currently reachable.

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it