I need to write a program (a project for university) that sol开发者_如何学JAVAves (approx) an NP-hard problem.
I have a digraph which is strongly connected (i.e. there is a path from i to j and j to i for each pair of nodes (i, j) in the graph G).I wish to find a strongly connected graph out of this graph such
加载中,请稍侯......