Location:
Search - matlab graph c
Search list
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 该代码实现了基于graph cut的图象分割算法,具体代码是用c++编写的,但提供了matlab接口,分割效果较好.-The code based on the graph cut image segmentation algorithm, the specific code is used c++ Prepared, but provides a matlab interface, better segmentation.
Platform: |
Size: 25600 |
Author: chinon |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length.
Platform: |
Size: 1024 |
Author: 忠波 |
Hits:
Description: C++编写的代码，主要用模板实现prefixspan的投影数据库架构及模式生长功能-C++ The preparation of the code, the main projection PrefixSpan realize template database structure and mode of growth function
Platform: |
Size: 4602880 |
Author: 肖庆明 |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: |
Size: 11264 |
Author: 岳明 |
Hits:
Description: graph cut matlab and c++ code for graph analysis
Platform: |
Size: 50176 |
Author: 李雯 |
Hits:
Description: 多尺度的光谱图像分割，有对应的论文和matlab及c++代码-Multiscale spectral image segmentation, there are papers and the corresponding matlab and c++ code
Platform: |
Size: 1876992 |
Author: chenyangji |
Hits:
Description: Graph Cut algorithm implementation. Includes MATLAB compiled codes.
Platform: |
Size: 526336 |
Author: GM |
Hits:
Description: This guide can draw a mandelbrot figure. In default values it calculates Z=Z^2+C for 20 iterations, where Z initally equal to zero and C has the values of every pixel created by meshgrid function(built-in).
although mandelbrot equation is Z=Z^2+C you can change the degree of the equation between 1 - 50.
higher number in iteration, points in axes gives better results in image besides more resulting time.
to zoom an area of the figure you must aproximately choose the point and then change the center values to this point values then push Show Graph button. because of this is the first version there can be any lack of usage.
-This guide can draw a mandelbrot figure. In default values it calculates Z=Z^2+C for 20 iterations, where Z initally equal to zero and C has the values of every pixel created by meshgrid function(built-in).
although mandelbrot equation is Z=Z^2+C you can change the degree of the equation between 1- 50.
higher number in iteration, points in axes gives better results in image besides more resulting time.
to zoom an area of the figure you must aproximately choose the point and then change the center values to this point values then push Show Graph button. because of this is the first version there can be any lack of usage.
Platform: |
Size: 8192 |
Author: Mike Gao |
Hits:
Description: 修改GNURadio中的频谱分析工具usrp_fft.py调用的C++模块gr_fft_vcc_fftw.cc，实现频谱的数据的存储，附有画图的matlab程序和实现的效果图，实现频谱数据分析需要。-Changes in the spectrum analysis tool GNURadio usrp_fft.py call C++ module gr_fft_vcc_fftw.cc, to achieve the spectrum of data storage, with a drawing program and achieve results matlab graph, the spectral data analysis needs.
Platform: |
Size: 126976 |
Author: |
Hits:
Description: graph cut 优化算法的最新版本，包含C++版本（在VS2005以上版本可以调通）和Matlab接口，-graph cut optimization algorithm of the latest version, includes C++ version (or later in the VS2005 can be transferred through) and the Matlab interface
Platform: |
Size: 67584 |
Author: tanghuang |
Hits:
Description: 1.GeometricContext文件是完成图片中几何方向目标分类。
参考文献《Automatic Photo Pop-up》Hoiem 2005
2 GrabCut文件是完成图像中目标交互式分割
参考文献《“GrabCut” — Interactive Foreground Extraction using Iterated Graph Cuts》
C. Rother 2004
3 HOG文件是自己编写的根据HOG特征检测行人的matlab代码
4 虹膜识别程序是下载的一个通用的虹膜识别程序，可以运行
5 GML_AdaBoost_Matlab_Toolbox是一个很好用的adaboost matlab工具箱
6 libsvm-mat-2.91-1 是用C编写的改进的SVM程序，代码质量很高，提供了matlab接口
7 SIFT_Matlab 是编写的利用sift特征进行的宽基线匹配，代码质量高
8 FLDfisher 是利用fisher 线性降维方法进行人脸识别-1.GeometricContext file is complete the picture in the geometric direction of target classification. References " Automatic Photo Pop-up" Hoiem 2005 2 GrabCut the target file is an interactive segmentation of image reference " " GrabCut " - Interactive Foreground Extraction using Iterated Graph Cuts" C. Rother 2004 3 HOG documents prepared under their own HOG Characteristics of pedestrian detection matlab code 4 iris recognition process is to download a general iris recognition program, you can run 5 GML_AdaBoost_Matlab_Toolbox is a good use of adaboost matlab toolbox 6 libsvm-mat-2.91-1 is written in C to improve the SVM procedures, code of high quality, provides a matlab interface to 7 SIFT_Matlab is prepared for the use of sift features a wide baseline matching, the code is the use of high quality 8 FLDfisher fisher linear dimension reduction method for face recognition
Platform: |
Size: 6918144 |
Author: 张数 |
Hits:
Description: matlab、C代码，实现图论中的大部分算法，包括kruskal、Dijkstra、prim、hamilton等
-Matlab,C code for most algorithms of graph theory.
Platform: |
Size: 6144 |
Author: hpx |
Hits:
Description: 基于非线性形状先验的图割，matlab的框架，C++的程序。-A priori based on nonlinear shape graph cuts, Matlab framework, C++
program.
Platform: |
Size: 209920 |
Author: tt |
Hits:
Description: 分形彩图的C或者matlab的源代，可执行的绘制彩色分型算法图形的C或者matlab的源代码，需要3段，也就是3张图。图片尽可能好看-The fractal color of C or matlab source code, executable drawing color genotyping algorithm graph C or matlab source code need 3 paragraphs 3 in Fig. Picture as possible look good
Platform: |
Size: 2048 |
Author: uestclxh |
Hits:
Description: 立体匹配中常用的方法，图割（graph cut），用到了a扩展及交换，程序涉及matlab及c-Stereo matching methods commonly used, graph cuts (graph cut), and uses a extended exchange program involving matlab and c++
Platform: |
Size: 1485824 |
Author: 新月 |
Hits:
Description: showing the graph of channel capacity and SNR in uplink LTE
Platform: |
Size: 11264 |
Author: Muthia
|
Hits:
Description: showing the the graph of channel capacity and SNR in AWGN of LTE
Platform: |
Size: 12288 |
Author: Muthia
|
Hits:
Description: showing the graph of channel capacity and snr in FSI of LTE
Platform: |
Size: 12288 |
Author: Muthia
|
Hits:
Description: 已知y=f（x）上一点（x1，y1），则在y=x直线上的点就为（y1，y1）。对应f（x）上点坐标即为（y1，f（y1）……依次类推，可以迭代出蛛网图形用来判断不动点是否稳定。模型为：x(t+1)=c*x(t)^2*(2-x(t)),其中c=25/16。(A point (x1, Y1) on the y=f (x) is known, and the point on the y=x line is (Y1, Y1). The point coordinates corresponding to f (x) are (Y1, f (Y1))...... By analogy, the cobweb graph can be iterated to judge whether the fixed point is stable or not. The model is: X (t+1) =c*x (T) ^2* (2-x (T)), where c=25/16.)
Platform: |
Size: 1024 |
Author: forevermorning
|
Hits: