How to evaluate the importance of each node effectively in the network, is very important to the design of the whole network. A new algorithm based on transmission flow and the shortest distance between two nodes in the network is proposed in this article—DFC algorithm. This method takes the flow of each node and the shortest distance between two nodes into account, evaluating each nodal importance to the network of the whole communication. Through the experimental simulation and the comparison with the general effective delete node method, this method is proved to have higher accuracy and more effective.