computerbox's blog

By computerbox, 4 years ago, translation, In English

Hello Codeforces Community!

Today I have studied the problem of finding the minimum spanning tree in a directed graph.
This problem is solved using the two Chinese algorithm (Chu-Liu / Edmonds' algorithm). You can read more about this algorithm in Russian using google translator in Oleg Davydov's blog A little about minimal spanning trees, in the ITMO wiki, here, AlgoCode Wiki. In English you can read in detail: Wikipedia, Tarjan's notes, Uri Zwick's detailed post.

I want to practice solving problems on this topic, but while searching I found very few problems.
Let's create a Codeforces sheet from tasks on this topic! Please help me with this! Share with the problem if you have solved on this topic.

Problems List:

  • Vote: I like it
  • +34
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

This website contains four problems related to minimum arborescence.