In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。
2
The scene at the moment mixed with that in the past becomes uncertain and unoriented. However, we can't help to think about the question that whether the history can be washed away so easily?