搜索资源列表
cellrecognition
- 细胞识别记数系统的实现,全部源代码,包括中心点标记,区域填充,记数等-,Visual C++,图形图象/Graph program -cell identification number system in mind the realization of full source code, including the focal point mark, regional filling, and so mind-, Visual C, graphic images / Graph program
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
prim
- 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
graph
- 图： 调试图的邻接链表存储的程序，解决下列问题： 根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
program
- 这是一个函数图像的源代码，用matlab编程的-function graph
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
Regular PEG
- 此程序 是一个C++程序. 通过PEG算法来构造 LDPC parity-check 矩正的Tanner 图.-This is a C++ program, which is used to construct Tanner graph of LDPC codes with the famous PEG algorithm.
toci
- Complex networks have some common basic model, such as random graph, WS small-world networks, NW small-world networks and scale-free BA network, the program generated from the mechanism of these networks to generate the complex network model and anal
Graph
- 程序采用C++编写，在C++Builder6.0中编译通过，用于计算简单图结构的连通度和结合度。-Using C++ program written in C++ Builder6.0 in compiles, used to calculate the simple graph structure, degree of connectivity and integration.
GraphPrj
- 针对大规模稀疏无向图开发的聚类算法。附带测试页面-this program is supposed to embark on the undiret graph clustering issue.
GraphCut_matlab
- graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic
surf_from_scatter
- It is a very useful matlab program to plot a 3D graph by using sfunction and it shows how to use multiplexur for x, y and z signals. Enjoy it and good luck.
Graph
- 该程序是用MFC实现的图的相关的运算，其中包括了图的深度有限遍历，广度优先遍历，最短路径等基本运算。-The program is MFC implementation of graph-related operations, including the depth chart limited traversal, breadth-first traversal, shortest path, and other basic operations.
GraphSeg
- this program for efficient graph based image segmentation
Graph
- 该程序主要完成对图的创建，并实现图的深度优先遍历和广度优先遍历-The program mainly to complete the creation of a graph, and to achieve depth-first graph traversal and breadth-first traversal
Graph
- 数据结构是程序开发的重要部分，而图无疑是重要的数据结构中常用的数据结构，该文件实现了图的生成和广度和深度遍历-Data structure is an important part of program development, and plans are undoubtedly important data structure commonly used data structure, the document generation and realization of a graph tra
CODE
- 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 虹膜识别程序
graph
- 数据结构实验六图的操作，在程序中提示输入的顶点数以及每两条边之间的权值，最后使用深度优先和广度优先算法实现遍历，同时构建最小耗费生成树的最小权值和路径。-Experimental data structure diagram of the operation of six, in the program prompts for the number of vertices and edges between every two weights, the final depth-first and