搜索资源列表
Example031
- -鼠标绘图，可以根据自己不同的需要绘制图形，供大家参考。-- mouse cartography, may be different according to oneself needs to draw up the graph, for everybody reference.
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
plotmap
- 图形绘制- The graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstrated
ShowRadarData
- 敏视达公司新一代天气雷达数据读取文件,通过它可以把反射率强度显示在屏幕上；Visual C++,绘图程序/Graph Drawing- Sensitively regards reaches the company new generation of weather radar data to read takes the document, through it may the index of reflection intensity demonstration on the scree
MYxcg-GRAPH
- 用c语言实行进入图形模式，以及各种图形操作的底层操作源代码，程序前有说明-implemented into graphics mode, and operation of the various graphical source code underlying operating procedures before Note
color.cpp
- 对于给定的图G，如果存在一种用2种颜色对顶点着色的 方案，使得图中任意一条边所连接的2 个顶点着有不同 颜色，则称图G 是可2着色的。-for the given graph G, if there is a use two colors of vertex programs, make a map arbitrary edge connected with two vertices are different colors, says G is 2-colored.
path.cpp
- 试在虚基类Network中增加一个函数FindPaths，对于给定的无向图G 和G 中的2 个顶点v和w，输出G 中从v到w的一条简单路径。若有多条可能路径，则输出任意一条。 -test in the virtual base class to add a Network Function FindPaths. For a given undirected graph G and G, the two vertices v, w, output from the G v w to a si
graphicsalgorithmy
- 一套很好的图论算法源码,包括图的遍历,最短路径的实现，有向图计算、拓扑排序等多个算法的源码。-a good graph algorithm source code, including the traverse map, the shortest path, and it is to map, many other topological sorting algorithm source code.
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
haokan
- 试扩充深度优先搜索算法，在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中，指针t指向生成森林上具有图顶点v信息的根结点。（提示：在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前，建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。） -try to expand the depth-fir
knight
- “八皇后”问题归朔法求解。八皇后问题是一个古老而著名的问题，该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen" The problem Schomburg method. 8 Queen's problem is
vb6mini
- 4dpsk和8dpsk的matlab仿真实现，采用蒙特卡罗仿真法，绘制误码率曲线-the realization of 4dpsk&8dpsk by matlab tool.it use the Monte Carlo methods to 程/Communicationdraw the graph.,matlab,通讯编程/Communication-4dpsk 8dpsk and Simulation of Matlab, using Monte Carlo simulation metho
daiquanwuxiangtu
- 带权无向图，是我修改别人的。自己看看能不能用-weighted undirected graph, I have altered others. See for yourself can use
diechartdemo
- 输入参数即可获得相应的饼图和柱形图。如：别克，丰田，捷达 会出现比例大小的图-Get input parameters corresponding pie and bar graph. Such as : Buick, Toyota, the Jetta will map the size ratio
simplegraph2.6
- Simple Gragh 2.6 TSimpleGraph is a visual component, which provides a simple user interface for drawing graphs. The control and its graph objects are fully customizable in the way that let you create almost any kind of graphs.-Simple TSimpleGraph G
Graphtsinghua
- 清华殷人昆版数据结构（c++版），图的所有算法调试成功。-Qinghua Yin Dynasty Queensland version data structure (c version), graph algorithms debug all success.
VB_CAD5
- For the convenience user watches the graph which draws up to be allowed to the view to carry on completely enlarges and reduces, the fractionated gain, the entire screen demonstration, the picture migration.-For the convenience user watches the graph
prefuse-beta-20060615
- prefuse是一个用户界面包用来把有结构与无结构数据以具有交互性的可视化图形展示出来. 这包括的数据有任何可以被描述成一组实体(或节点)或者可以被连接在一起的一些关系(或 边缘).prefuse支持的数据包括具有层次性(如:文件系统,组织图)-prefuse is a user contact surface package uses for to have the structure by to have with the non- structure data the interacti
emploeyee1
- 无向图的深度优先搜索，老师写的，绝对没错-undirected graph of the depth-first search, the teacher was absolutely right!
euler2
- 对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路.-for the given graph G, the map after each side exactly two times the loop known as the G-Euler circuit.