搜索资源列表
graph_string_file
- Introducing the new and improved CGraph Classes!! CGraph was my attempt to produce a set of freeware graph classes. After several iterations of the classes, it became more and more difficult to maintain and support. 这是我在CGRAPH4的基础上和StringFil
Telerik.WinControls.RadChart.r自定义的图表控件
- r.a.d.chart是一个完全可自定义的图表控件，可以显示复杂的图形数据，该产品提供4种基本类型的图表 – 饼状图（Pie）, 条状图（Bar）, 线形图（Line）,和范围图（Area），每一个都可以被充分的定制，r.a.d.chart能够帮助您更加人性化地表现和利于领会复杂的数据 ,radchart is a completely customizable chart control, can display complex graphics data, the product provi
graph
- 在DOS下显示16位位图。（TC编译通过） 颜色与原位图的颜色不匹配，这只是一个测试程序，但在图像下面有一个调色板，可以通过w,a,s,d键选择两个颜色进行对调。每选择一种颜色后通过Q键确认。-DOS shown in the bitmap 16. (TC compiler through) colors and in situ does not match the color map, this is just a test procedure, but there is a palett
catia_CreateCamShaft
- catia二次开发源码，通过设计曲轴的参数，在catia中自动生成发动机曲轴3维图-catia secondary development of source, by designing the parameters of the crankshaft, in catia automatically generate 3-D graph engine crankshaft
Graph_dll
- 下载了本站的Graphic源代码，但是缺文件，找了好久，终于找到了，下载了Graphic源代码的可将本人上传的Graph_dll.rar解压到目录下就可运行-Graphic site downloaded the source code, but the lack of documents, looking for a long time, finally found, downloaded Graphic source code can be uploaded I Graph_dll.rar
Dijkstra
- 该问题为单元最短路经问题，求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边，有向图的信息由一个邻接表来表示，另外对每个顶点都设置一个属性d[v]，描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S，反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中，算法中还用到了顶点的最小优先队列，排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed
asm__graph_DLL
- Little game I ve made to understand gdi-Little game I ve made to understand gdi
Functionplotter
- This a function plotter making use of runtime compiling .NET-features. Just input a formula and click on start. A function graph output will occur automatically. If you d like to update the graphics output after resizing the window just
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
ShortRoute_Dijkstra
- 图论中最短路径计算D算法MATLAB源代码，修改网络上D算法的错误，并编写通用的MATLAB函数-Graph theory, shortest path algorithm for computing D MATLAB source code, modify the network D algorithm error, and the preparation of general MATLAB function
graph
- 计算机数据结构图的最短路径算法：D算法（输入权值和顶点）-Computer data structure diagram of the shortest path algorithm: D algorithm (input weights and vertex)
WinForm
- C# 拖动图像，并放大和缩小，使用了不少三方插件，比如AxInterop.OWC10.dll、AxSHDocVw.dll、Interop.OWC10.dll、Microsoft.Office.Interop.Graph.dll、Microsoft.Office.Interop.PowerPoint.dll、SHDocVw.dll、office.dll等，觉得程序实现的方法不是太简，用了这么多额外的控件，与实现的功能好像不成正比，呵呵，个人之见。 -C# Drag the image and
SkinH_VC
- SkinSharp换肤库源码上传，包含.lib、.dll、.h文件以及相应的例子实现换肤，vc++编程-SkinSharp for change the skins with VC++
Project1
- vb 读取EXCEL中的趋势图比如D盘下有一名为graph的Excel文件。里面有一个直方图。现在新建一个窗体，窗体上放置一个PictureBox，一个按钮。单击按钮，将读取D:/graph.xls中的直方图到图片框-Private Sub Command1_Click() Dim mXlsApp As Excel.Application 应用 Dim mXlsBook As Excel.Workbook 工作薄 Dim mXlsSheet As Excel.Worksheet
NFA-to-DFA
- Theory: NDFA: It is a mathematical model containing 5 tuples a) Q- finite non empty set elements of which are called as state. b) T- set of alphabets. c) δ- is a mapping function Q*{T {λ}}*2Q d) S-start state i.e. S ε Q e) F- F (su
ddspphomeworri
- 数字信号处理的应用之一是从含有加性噪声的信号中去除噪声。现有被噪声污染的信号x[k]=s[k]+d[k]，式中： 为原始信号d[k]为均匀分布的白噪声。（1）分别产生50点的序列s[k]与白噪声序列ddd[k]，将二者叠加生成x[k]，并在同一张图上绘出x0[k]，d[k]与x[k]的序列波形。（2）均值滤波能有效去除叠加在低频信号上的噪声。已知3点滑动平均数字滤波器的单位脉冲响应为h[k]=[1， -One of the applications of digital signal pro
Storage-experiments-undirected-graph
- 1）将右图按照邻接多重表进行存储 2）依次输出顶点表中，各顶点的数据值 3）根据邻接多重表，依次输出依附于各顶点的边，如：A: (A,B), (A,E),(A,D)。 -1) to the right in accordance with the adjacent multi-table memory 2) sequentially outputs the vertex of the table, the data values of the vertic
d
- 求一个连通无向图的最小生成树的代价（图边权值为正整数）。-Seeking a communication cost of the minimum spanning tree of undirected graph (Figure right side is a positive integer).
hyy_d
- 图论D算法求最小路径，应用于路由选择问题(Graph theory, D algorithm, minimum path)
degrees_unda
- calculation degree of a graph