给定一个2n*2n的残缺棋盘，问如何放置三格板，使得除残缺格外，棋盘中其他格子都被三格板覆盖，并且放置的三格板互不重叠。-Given the deterioration of a 2n* 2n board, and asked how to place three cell plate, making the extra addition to incomplete, the board were three other lattice grid plate coverage, and pla

适用于大型网格图的最大流最小割算法，适合初学者-The regionpushrelabel-v1.03 library computes max-flow/min-cut on huge N-dimensional grid-graphs in graphics, vision, and medical imaging. The C++ implementation is designed specifically for multi-core systems and graphs larger