Fmin=∑nmAij1widij|
Where Aij is the element of the adjacency matrix and wij is the weight of the edge between node i and node j.
The minimum Fmin can be found by finding the minimum value of Aij multiplied by wij for all edges in the graph. This can be done using a variety of algorithms, such as dynamic programming or branch-and-bound.
免责声明：
以上内容除特别注明外均来源于网友提问，创作工场回答，未经许可，严谨转载。