搜索资源列表
segment
- Graph cut Image Segmentation
fsk_dft
- 基于DFT的fsk调制解调算法仿真源代码，给出误码率-信噪比图。-source code for fsk modulation-demodulation algorithm based on DFT and EBR-SNR graph is given.
1
- 这是根据数据结构图论里的动态规划、Dijkstra算法理论写的小程序。希望大家喜欢！-This is based on the data structure graph theory, where the dynamic programming, Dijkstra algorithm theory, write a small program. Hope everyone likes!
8021GUI
- 802.1x客户端，基于图新界面的，这里是核心C-802.1x client, based on graph the new interface, here is the core of CPP
word2
- 该程序基于labview编写而成，可以在Word文档中插入各种曲线图。-The program is based on labview compiled from a variety of graph can be inserted in a Word document.
tu
- （1）键盘输入数据，建立一个有向图的邻接表。 （2）输出该邻接表。 （3）建立一个无向图的十字链表。 （4）在有向图的邻接表的基础上计算各顶点的度，并输出。 （5）采用邻接表存储实现无向图的深度优先遍历。。 （6）采用邻接表存储实现无向图的广度优先遍历。 （7）以有向图的邻接表为基础实现并输出它的拓扑排序序列 （8）采用邻接矩阵存储实现无向图的最小生成树的PRIM算法。 （9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) keyboard input
text
- 给定N个顶点、E条边的图G，完成图的相关算法，具体要求如下： 1 完成图的创建方法，即从键盘或文件输入图的信息，建立图的邻接表或是邻接矩阵存储结构。 2 给出判定图的性质的算法，即能够判定图是否是有向图、无向图、有向无环图、连通图等。 3 根据输入的图的性质，实现以下算法（选择其中一两个）： 如果图是有向无环图，则先实现图的某种遍历算法，在此基础上实现图的拓扑排序算法。 如果图是连通图，则求出图的最大生成树（不是最小生成树，参考讲授的方法），即得到的生成树权值之和最大
leach-vs-heed
- matlab code is performing a comparative analysis of leach and heed. This code runs total four number of models, out of which two are leach and other two are heed. Output is shown graphically, which shows two graphs. First graph is based on Total Data
s6
- 数据结构 在图G中求一条从顶点i到顶点s 的简单路径。 实验目的： 1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构； 2、熟练掌握图的深度优先遍历和广度优先遍历算法； 3、在遍历算法的基础上设计其他应用算法。 -Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage
Dijkstra
- 这是一个使用循环算法实现寻找已经定义好的无向图的最短路径算法，基于Dijkstra思想，使用VS2010进行编程。-It is a cycle has been defined algorithm to find the shortest path algorithm undirected graph, based on Dijkstra ideas, using VS2010 programming.
Dijsktra_final
- 基于Dijkstra方法的最短路径改良版方法,能够一次性搜索出最优最优起点终点、最优路径、路径长度，常用于图论相关问题-Shortest path method ,which is based on a modified version of the method Dijkstra, is possible to search out the best starting point, terminate point, the optimal path, and the path length.I
max_flow_min_cost
- 基于matlab的最小费用最大流的实现,用于最优化运输路径的选择，常用于图论问题、资源分配最优化问题-Matlab-based program of the minimum cost maximum flow ,which helps select optimal transport path. It is commonly used in graph theory problem of resource allocation optimization problem
UNDONE(2)
- 图算法的一个大作业，根据输入矩阵构成图，不同的值表示四个方向邻接类型，在图中搜索死路，活路的算法。-A large job graph algorithms, based on the input matrix block diagram, showing the four different values of the direction of the adjacent type, the search in the drawing die, the way out
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
ljnew
- 读取矩阵，算出上三角矩阵，根据随机建立的点，然后进行连接矩阵网络图。-Read the matrix, calculate the upper triangular matrix, based on the random set up points, and then the connection matrix of the network graph.
main_bayes_markov
- 基于相干系数与空间信息的干涉SAR 相干图分割-Segmentation of interference SAR coherent graph based on coherence coefficient and spatial information
concom
- matlab判断图的连通性的小程序,亲测可用-Determine the connectivity of the graph Based on MATLAB.
gbvs
- 新的自下而上的视dmits combination with other maps. The model is simple, and biologically plausible insofar as it is naturally parallelized. This model powerfully predicts human xations on 749 variations of 108 natural images, achieving 98% of the ROC area
LDPC_BSN
- This is about data decoding based on factor graph
aco
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the a