搜索资源列表
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph=( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of topological sorting algorithm.
PSO-TSP.rar
- 本程序是一个用POS来求解NP难问题,比图TSP问题,实际仿真效果证明改算法合理,This procedure is a POS to use NP hard problem to solve than the TSP problem graph, the actual simulation results prove that a reasonable change algorithm
GraphGA-TabuHierarchicalLayout
- This article presents one of the most famous hierarchical graph drawing algorithms. Starting from a hierarchical graph we create a population of chromozoms that will be used in a Genetic Algorithm to get the best subjective representation: minimal ed
TrafficCommand
- 建立交通网络图的存储结构 解决单源最短路径问题(Dijkstra算法) 实现两个城市之间的最短路径的问题 用MFC实现可视化菜单界面,使操作更加人性化,包括启动界面、图标、背景、按钮、界面框架等设计-Established transportation network graph structure to solve the storage problem of single-source shortest path (Dijkstra algorithm) to achieve t
pf-segmentation-master
- Matlab interface for the image segmentation algorithm of Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb and Daniel P. Huttenlocher International Journal of Computer Vision, 59(2) September 2004. -Matlab interface for the i
CODE STUDIO
- CODE STUDIO C# GDI+ development class Viso fl matlab used in drawing commands i This is the windows QT programmin Program of the curve, a real-time Mouse set control points, draw B- java drawing board simulation win Mastery letter. Lc5 file to be mo
Dijkstra
- Dijkstra算法(单源最短路径) 单源最短路径问题,即在图中求出给定顶点到其它任一顶点的最短路径。-Algorithm (single-source shortest path) Dijkstra,single-source shortest path problem, namely to obtain a given vertex to any other vertex of the shortest path in the graph.
NetFlow
- 使用MFC实现最小费用流算法 包括在界面上画拓扑图等功能,编译器VC6.0(Using MFC to realize the minimum cost flow algorithm, including the function of drawing topological graph on the interface, compiler VC6.0)