Search - 2-3-4 tree

Search - 2-3-4 tree - List

[Special Effects] dtcwt_toolbox4_3 DL : 0: 国外编写的双树复小波的一个开发包，包括1维和2维的情况，文件中有说明。-The Dual-Tree Complex Wavelet prepared outside of a development package, including the one-dimensional and two-dimensional case, the document has made it clear.
Date : 2025-12-17 Size : 70kb User : 殷代强
[Special Effects] ApplicationsOfDepth-FirstTraversal DL : 0: 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirected graph is connected or not. 2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle. 3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm. 4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Date : 2025-12-17 Size : 10kb User : 卢竹江
[Special Effects] MRF-benchmarks DL : 0: markov random fields的各类优化算法及应用Optimization methods included: 1) ICM 2) Graph Cuts 3) Max-Product Belief Propagation 4) Sequential tree-reweighted message passing (TRW-S) Applications include: (1)binary (2)denoise (3)stereomatch (4)Photomontage 源码（http://vision.middlebury.edu/MRF/code/）已经过本人修改，替换，更新等，目前可在VS2008上编译运行。如有疑问，请添加本人QQ：1150271506-Implementation of various optimization algorithms and applications of markov random fields. You can run directly on VS2008.
Date : 2025-12-17 Size : 32.78mb User : jhdai