minimize cost function for undirected graph

hello,

I want to cut undirected graph in order to minimize the cost function. I want the cost function to consider the edge weight.

Flowchart: 1.make a graph 2.set the weight of the edges 3.cut the graph according to connectivity and weights.

thank you!

Answer 1

[Josh Meyer]

maxflow can calculate minimum cuts. Also, centrality calculates several measures of node importance that consider cost.