# Graph closure problem [closed]

In graph theory exist the closure problem. In particular the maximum closure problem a directed graph $G = (V, A)$ with vertex weights $w_i$ is given and we want to find a closed subset of vertices $V\;'$ such that

$$\sum_{i\in V'} w_i$$

is maximum.

I implemented a python lib for solve this problem, Exists other lib for compare the results ?

-
Have you heard of Sage? It's an open source mathematics computer program that is based on Python. I don't think there is such a function, but it has a lot of stuff built up already for graphs. So, if you're trying to do various things with graphs, it might be easiest to use Sage in the long run, if you're going to do it in Python any way. And, if you want, you can always contribute your programs to Sage so that other users will later be able to use them. sagemath.org It wouldn't take long to program that in Sage. –  Graphth Nov 6 '11 at 14:57
I see the documentation and screenshots of sage, I think sage used the NetworkX library, which I'm using and have no solutions to max closure –  juanpablo Nov 6 '11 at 16:39
Yes, they use NetworkX. I didn't say they had a solution. In fact, I said they didn't. I was just letting you know about it in case you didn't. It may not have that already programmed, but it has a lot of other stuff. Some of that is NetworkX stuff, some of it is not. So, in the future, you may save yourself some time depending on what you're working on. –  Graphth Nov 6 '11 at 16:48
@Graphth ok, I'll keep in mind –  juanpablo Nov 6 '11 at 17:40