Recently, the algorithm for achieving Graph Paprtition has been distressed in efficiency until. . . Change all STL to a simple data structure, and the efficiency is ten times! ! !
In fact, I have used the vector in the original algorithm, and in addition to initialization, I only use Operator inside the algorithm []! I can't think of it. . . All optimizations are more than the tragedy of VC.
I also tested the GCC, the product's Operator [] efficiency and array basically, let me have no monster STL.
