搜索资源列表
2007112923259980
- powerbuilder for graph exmple
samgraph
- powerbuilder for graph exmple
graph_picture
- powerbuilder for graph exmple
GCmex1.2.tar
- graph cut matlab and c++ code for graph analysis
example
- an example using graph cut c++ code for graph analysis
Dijkstra
- 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 -The Dijkstra shortest path algorithm for the proce
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
graph
- 一个关于图的数据结构程序，涵盖这四种图的表示方法和实现方式！-A graph data structure procedures, covering the four graphs that the methods and the realization of the way!
Graph
- 不需控件的快速绘图方法，在VB中实现不用控件绘图-Controls without rapid mapping method in VB to achieve without control graphics
SouceCode1_Source
- graph cut for itk. It uses a-expansion. Must install itk first and run with itk.
LGE
- LGE算法（Linear Graph Embedding）用于降维，代码比较长，比较复杂。供大家研究！-LGE algorithm (Linear Graph Embedding) for dimensionality reduction, code longer, more complicated. For everyone!
OLPP
- 正交的Linear Graph Embedding算法！用于降维，供大家学习交流。-Orthogonal Linear Graph Embedding Algorithm! For dimensionality reduction for them to learn from the exchange.
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
networkandgraph
- network and graph optimal algrithom classic book
graph
- 可实现坐标平台显示功能，X Y 坐标可调，界面可拉伸-Platform enables display coordinates, XY coordinates adjustable interface tensile
GraphEditor3.3
- 图形界面,创建图形,连接图形,删除图形的基本框架-Graphical interface, create graphics, connected graph, delete the basic framework of graphics
Dijkstra
- Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
TravellingSalesman
- 旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
graphAnalysis
- 该文件是用matlab开发的图论分析工具箱， 里面有使用时的详细说明，pdf说明文档。 绝对实用对于图论的研究者-The document was developed with matlab graph theory analysis toolbox, which are used when a detailed explanation, pdf documentation. Absolutely useful for researchers in graph theory
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary