This work adopts the greedy principle to tackle this NP hard problem by iteratively updating the network toward the probable optimal discrete solution in each iteration, and provides a new perspective to visualize and understand the effectiveness and efficiency of the algorithm.