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.