As mentioned in the title I am looking for a python implementation of the Ant Colony Optimization (ACO) algorithm to solve the Minimum Steiner Tree problem in graphs or the minimum-spanning-tree problem. I can't seem to find any publicly available packages for minimum trees, let alone minimum steiner trees on GitHub, PyPI, etc. as most ACO packages only solve the Traveling Salesman problem (e.g ACOpy, scikit-opt, swarmlib, and PyGMO). Can anyone give a recommendation?
I have a cost matrix of a connected but not complete graph as input as well as a 1D-array defining which of the nodes are terminals. Best case would be a package that uses networkx for graph representation.
