I am using the networkx framework for graph manipulation in python 2.7. For obtaining an optimal branching (arborescence) from a directed graph, I wanted to use the Edmond's algorithm.
On networkx' website, one can find an implementation of that algorithm. The class 'Edmonds' is also listed in the reference.
However, I can't find the actual module which contains this class. Is it not an official class contained in the release?
Both of your links are to the 'development' part of networkx (check the url), so I don't think it's in the standard release yet.
Probably your best option is to copy the relevant code into a file in your working directory and import it separately. Otherwise, look to download the development version of networkx.
More details: http://networkx.github.io/documentation/development/
According to https://networkx.github.io/documentation/latest/install.html