In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区,在图上研究分区算法。
In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.
本文将网格分区问题转化为无向赋权图的分区,在图上研究分区算法。
应用推荐