I am looking for a java graph library that allows finding Steiner trees. Is there a library that supports finding both exact (for small graphs) and approximate trees?
Thank you all for the answers. I found this GitHub page which provides implementations of various heuristics. GreedyFLAC seems to be working really well: