搜索资源列表
dijkstra-general
- Dijkstra通用算法，最近一段时间一直在搞图论的相关算法，发现Dijkstra是一个很好的单元最短路径算法，此程序很短，非常适合学习-Generic Dijkstra algorithm, the most recent period has been engaged in graph theory algorithms, Dijkstra is a good unit the shortest path algorithm, this procedure is very short, ve
SILK-GC_GPU
- 在基于核的在线学习方法的基础上加入了图切割技术，用于背景建模和前景提取。-The kernel-based online learning method based on graph cut technique for background modeling and the prospects for extraction.
zui-duan-lu-jing
- 利用图论知识用c语言编写的最短路径算法，供大家准备数模学习时使用，编译通过的，非常经典！-Using the shortest path algorithm, graph theory knowledge c language for everyone to prepare for the number of the mode to use when learning, compiled by, very classic!
Highcharts-2.3.3
- Highcharts 是一个用纯Javascr ipt编写的一个图表库, 能够很简单便捷的在web网站或是web应用程序添加有交互性的图表，并且免费提供给个人学习、个人网站和非商业用途使用。目前HighCharts支持的图表类型有曲线图、区域图、柱状图、饼状图、散状点图和综合图表-Highcharts is a charting library written in pure Javascr ipt, very simple and convenient web site or web appl
tulunchengxu
- 压缩包内包含了几乎所有图论的matlab编程的程序，而且都有详细的语句说明，很好上手学习！-Compressed package includes almost all of the graph theory matlab programming procedures, and has a detailed statement illustrates well get started learning!
MinCut
- 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
TanLan
- 图论贪婪算法详解，有算法原程序以及各种例子，而且还有pdf，ppt讲解。是学习的很好工具。-Graph theory greedy algorithm Xiangjie algorithm original program as well as a variety of examples, but also pdf, ppt to explain. Is a good tool for learning.
Drawingpro
- 学习vc++时编写的绘图程序 完成了读入一组数据后产生该组数据柱状图和趋势图的绘制-Drawing the learning vc++ written procedure is completed the data histogram and trend graph of the group reads a set of data drawn
floyd
- 此源码是算法floyd算法的实现,里面有我自己详细解说的几个重点，对于学习图论很有帮助，用于求任意两点间最短路径和路径长度-This source is the realization of the algorithm floyd algorithm, which has my own detailed explanation of several key helpful for learning graph theory, used to find the shortest path betw
GOLPP
- GOLPP,来自南京航空航天大学,一种基于图优化的流形学习方法。-GOLPP, from nanjing university of aeronautics and astronautics, and a manifold learning method based on graph optimization.
Coloring-Problem
- Cellular Learning Automata-based Graph Coloring Problem
HW1
- Machine Learning: using maximum likelihood, baysiean to learn a graph
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
76586435465
- C#产品走势图，C#源码实现，利用图表分析产品销售走势，请先连接Database数据库中的文件，配置完成后再测试，否则看不到走势图，如截图所示的就是没有数据库状态下的运行界面，作者拥有版权，仅供学习与参考。-C# charts, C# source code implementation, analysis of product sales trend with the chart, please connect Database database files, configuration af
cSharptouying
- 一个c#程序画的一个图形，通过投影得到不同的视图，很有学习价值-A c# program draw a graph obtained by projecting a different view, it is worth learning
liantongtu
- 本程序是学习图论连通图的极佳案例，可以清楚地进行任意建立集合图，并且随意选取点来自动进行判断连通。-This program is a connected graph graph theory learning an excellent example, one can clearly create a collection of arbitrary figure, and selected at random points automatically determine connectivit
Graphic
- 实现了各种工业图形的绘制，柱状图，圆形图，线性图等等。内容丰富，很值得学习。就是有些函数还是看不懂，这里供更多人参考-Realization of the drawing, various industrial pattern histogram, pie chart, line graph etc.. Rich in content, it is worth learning. Is some function still cannot read, more people here for r
Transformer
- 利用Java实现的图的不同表示方法的转换器，从文件读入一个有向图的权矩阵表示(含有矩阵阶数)，输出这个图的关联矩阵、边列表、逆向表、邻接表表示。可作为图论的学习材料。-Using Java to achieve different graph representation of the converter, the file is read from a directed graph represents the weight matrix (containing a matrix of ord
MATLAB
- 主要介绍了各种图论算法及其他们的matlab程序实现，这本书很好的帮助了入门的新手学习图论算法.-Introduces a variety of graph algorithms and their matlab program, this book is a good help the novice learning graph theory algorithms.
ScoreManageSystem
- 这是学习C++的过程中，练习面向对象思想的最好的例子，就是学生成绩国力系统 -This is a learning process C++ practice of object-oriented thinking the best example is the national system of student achievement Floyd algorithm- the shortest path directed graph