搜索资源列表
tuxiangguangsuanfa_SourceCode
- 这是本人精心搜集的关于常用图论算法的一套源码，代码内附注释，可供需要的朋友作为参考-carefully collected on the graph algorithm commonly used in a set of source code, code contains Notes the need for a friend as a reference
jige
- 这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-This is the mathematical modeling of graph theory of a number of important model solution. Shortest Path, including the two methods, and the weighted Solution
function1111
- matlab的常用函数工具包，可以计算多数的图论问题，和组合问题。-Matlab tool kits commonly used functions can be calculated majority of the graph theory, and composition.
c_alg
- c++常用算法集,包含数据结构,图论等成熟经典算法-c commonly used algorithm set includes data structures, graph theory, and other mature classical algorithm
sjjg_suanfaji
- 数据结构及算法C语言实现代码集.有数据结构中的常用算法源码（c语言编写），如图论算法、线性表、栈和队列的及一些常见的计算问题-err
Graph
- 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。-I prepared a number of graph theory code, including deep search, minimum spanning tree, shortest path, notes I wrote in great detail, we can serve as a reference entry.
xiongyali
- 图论中的匈牙利算法，对于研究网络的人十分的有用-Graph Theory in the Hungarian algorithm, for the research network of people is very useful
matlab_ISP
- 用matlab编程求解图论中独立集问题(ISP),程序简单明了,希望大家能提出更进一步的改进意见.-Matlab programming using graph theory for solving Independent Set Problem (ISP), the procedure is simple and hope that we can introduce a further improvement.
matlab_MCP
- 用matlab求解图论中最大截问题，带有例子，简洁可靠。-Using matlab to solve the biggest cut in graph theory problem, with examples, simple and reliable.
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、 树的遍历；七 进制转换；八 全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory alg
FibonacciHeap
- FibonacciHeap是一种优先队列，就平均而言有很好的性能，所以在一些图论算法中可以用来作改进算法的数据结构，尤其是那些稀疏图，总之是很好的工具。下面以设计者的角度简单描述我设计它的过程和思路。-FibonacciHeap is a priority queue, on average, have a good performance, so in a number of graph theory algorithms can b
graphprogramming
- 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, f
200756135454786
- 图论算法及其MATLAB 程序代码求赋权图G = ( V , E , F ) 中任意两点间-Graph Theory Algorithm and MATLAB code for weighted graph G = (V, E, F) between two points in arbitrary
stream
- 网络流算法 涉及：数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
graphtheory
- 这是一本关于离散数学里图论知识及其算法的详细讲解，文字通俗易懂，图文并茂
tulun
- 本程序是关于图论的一个程序，对图论中各个定点着色进行了分析-This procedure is on the graph theory, a procedure of graph theory in various fixed-point shading analysis
GraphAlgo.pdf
- 一本比较老的图论算法书，没有找到书名，是从超星PDG转成PDF的，里面介绍了图论的基本知识，以及一些著名的算法，比较有参考价值。-An older algorithm graph theory books, did not find the title is from the Chaoxing PDG into PDF
GraphAlgori
- 图论算法中dijkstra、Floy、和最小生成树算法的实现，使用类进行封装-Graph theory algorithm dijkstra, Floy, and the minimum spanning tree algorithm, the use of encapsulation
Graph_theory_matlab_program
- 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program,
floydzuiduan
- 图论中求最短路径问题，首先形成矩阵，调用矩阵，用此函数求出各点间最短路径-Graph theory to seek the shortest path problem, first of all, the formation of matrix, called matrix, use this function to derive the shortest path between points