搜索资源列表
qiege
- 找到图形中的轮廓 并以轮廓切割图形并分别显示出来-Find the outline of the graph and cut it with the outline.
cut_image_into_9_part
- 将一张图片等分成若干小份,首先导入图片转换成矩阵,截取矩阵,生成图片-Cut a graph into nine small graphs
simulated annealing algorithm
- 模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
GrTheory
- 多种图论算法的matlab实现 例如:% ntest=1 - grBase求有向图的基 % ntest=2 - grCoBase求有向图的逆基 % ntest=3 - grCoCycleBasis求连通图的基本割集 % ntest=4 - grColEdge图的边着色(边染色) % ntest=5 - grColVer图的点着色(节点染色)(% grBase - find all bases of digraph; % grCoBase - find all contrabases
枝切法和质量图法相位解缠
- 利用枝切法和质量图法引导相位解缠,可用于InSAR数据处理(Phase unwrapping guided by branch-cut method and mass graph method)