I am trying to have an implementation on Python for Edmond's maximum branching algorithm.
Maximum Branching Problem. Given a directed graph G=(V,E, w) where w be the weight function. For a root r in V, determine a branching G'=(V,E') rooted r, i.e. G' contains no cycles and has all vertices with indegree at most 1, with largest total weight.
The Edmond's algorithm can be found here: http://www-di.inf.puc-rio.br/~poggi/mba.html
Do you have an an implementation on Python for this problem?
Edited:
Thank you, guys. I just mimic one solution on Stackoverflow and get the answer here: https://colab.research.google.com/drive/1kFynHGSXxYlr__2M3zl1kJtdPZTy5Ly7?usp=sharing