搜索资源列表
M
- Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin
TextureSynthesis
- 基于块拼接的纹理合成算法实现,在最小误差路径切割时做了修改,在重叠区域寻找回溯点再同时向下和向右寻找切割路径-Splicing block-based texture synthesis algorithm, the minimum error path of the cutting was revised, in the overlapping area at the same time looking for back points and then cut down and find th