搜索资源列表
segment-win
- Efficient Graph-Based Image Segmentation 一篇论文的代码，修改后，在VS2008运行环境下编译通过-Efficient Graph-Based Image Segmentation paper code, revised in the operating environment under the VS2008 compiler through
c
- 采用邻接矩阵表示法创建有向图，是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
top_graf
- A graph topology in a paralel computing
throughput.pl
- This a perl file that helps you plot a throughput graph using ns2-This is a perl file that helps you plot a throughput graph using ns2
Charting
- Graph drawing using visual basic program
Chart
- Graph drawing example
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
graph
- 自己做的UML活动图编辑系统。利用VC＋＋的基础类库（MFC），把各种图元抽象成了各个类，利用类与类中的关系把图元中的关系表示出来。图元的基本操作用类中的方法实现。-Do their own editing system UML activity diagram. Use the basis of VC++ Class Library (MFC), the various abstract elements become all categories, the use of classes an
CE_graphTest800x480
- 在WINCE 下的GRAPH演示，目的是要做出像LabWindow下的Graph控件。（可以在WindowsXP的直接打开）。这是800X480版本-In GRAPH under WINCE demonstration, the purpose is to make as the Graph control LabWindow. (Can be opened directly in WindowsXP)
boundsonLDPCandLDGM
- The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. T
graph
- graph 图的相关算法 含有遍历等操作 有解题报告 详细说明-graph
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
segmentation
- This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited
graphtheory.pdf
- 图论，Graph Theory，第二版，Reinhard著。比较经典的书。-Graph Theory, Graph Theory, second edition, Reinhard forward. Comparison of the classic book.
Graph
- this is 2D graph example-this is 2D graph example....
C
- C编程 完美数值算法 经典的数据结构算法，包括数论算法，图论算法，背包问题等-C programming classic numerical algorithm perfect data structure algorithms, including number theory algorithms, graph theory, algorithms, and so on knapsack problem
mini-span-tree
- 关于最小生成树一些算法程序 对于数学建模 图论建模等方面有重要作用-Minimum spanning tree algorithm on a number of procedures for the mathematical modeling aspects of graph theory modeling plays an important role in
multiStageGraph
- 使用动态规划求多段图的C++源程序，用于满足最优化问题且问题能转换成一个有向图问题的求解，可以直接运行！-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you ca
VB6-TrigonometricGraphing
- A Trigonometric Graph Maker It helps you make graphs of amplitudos & frequent
3DGraph
- XYZ graph is a program to visualize 3D - data. Three cross sections along the XY- , XZ- , and the YZ-plane are shown. By moving the hairlines the user can scan through the the various voxel planes. Input files can be either binary or ascii. To vi