Aalchemist's blog

Directed minimum spanning tree
By Aalchemist, history, 8 years ago, In English

Can anyone provide me a good source to learn about minimum spanning tree in a directed graph.The sources I found in the internet were very complex...

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

Comments Comments (1)
| Write comment?
»
8 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

The spanning arborescence problem is indeed much harder than the MST one. You can read about it here -> Edmonds' Algorithm

→ Reply