Different graph partitionin criteria.


I want to have graph partitions that doesn't have min cut but graphs which have max cut instead.

I think it should be just the optimization part of the code that picks up the min cut graph as opposed to the regular minimization tecniques.

Is this what all I need to do or there is other things that I need to consider besides this.



RE: You can certainly modify

You can certainly modify Metis's optimization code to compute the max cut by changing the objective in the optimization routine. However, Metis has been optimized for min-cut and as such its coarsening/refinement framework is not well-suited for max-cut.
It will probably be easier for you to either look for a code that does solve the max cut problem or writing one yourself.