搜索资源列表
sjjg_suanfaji
- 数据结构及算法C语言实现代码集.有数据结构中的常用算法源码（c语言编写），如图论算法、线性表、栈和队列的及一些常见的计算问题
mintreek
- 图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5
PrimsAlgorithm
- 图论Prime算法Matlab源代码,来源www.matlabsky.cn-Prime graph theory algorithm Matlab source code, source www.matlabsky.cn
tulunsuanfa
- 图论中的各种算法及实现，编写流畅，希望有用，用pdf文档给出，编写质量比较高，适合初学图论算法的人。-A variety of data structure algorithms using C++ development, I hope useful, given a document with word, the preparation of relatively high quality, data structure suitable for beginner person.
MyLib(JLUACM)
- 吉林大学2005版acm问题集锦，涵盖面广泛，涉及图论，算法。 -JLUACM
08_DP
- 严蔚敏数据结构算法实现 其中对树，图论算法进行了C++实现-Yan Wei-Min algorithm data structure in which the tree, graph theory, algorithm C++ Implementation
minimum-spanning-tree
- 在数据机构中，在图论中，搜索整个图，生成最小生成树。-Data organization, in graph theory, search the entire diagram, generate a minimum spanning tree.
pictrue-struct
- 一个建立图论的三种方法，很实用，可以用作模板-An establishment of three methods of graph theory, it is practical and can be used as a template
graph
- 基于图论的应用，简单的实现及其功能，以及利用图论解决商人问题-Based on the application of graph theory, a simple realization and function, and the use of graph theory to solve the problem of businessman
classical-algorithms
- 许多经典算法问题的源代码,包括数据结构,分治,回溯,动态规划,图论,贪心等等,包括了C,C++和Java代码,已分成文件夹整理好.-Many classical algorithms of the source code, including data structures, divide and conquer, backtracking, dynamic programming, graph theory, greed, etc., including C, C++ and Java cod
chuanjiaoshi
- 图论中的搜索算法，传教士过河问题，找出最佳搜索路径-Graph theory search algorithm, missionaries across the river, to find the best search path
ProjetDeGraphe1.3
- 课程设计作业，图论简单理论的实现，例如传递闭包等，其中很多注释是法语。-Curriculum design, graph theory, the theory of simple realization, such as transitive closure, etc., many of which comment is French.
Floyd
- 这是一个完整可用的flyod的计算算法。我们可以通过flyod对图论进行快速的分析和解算。-This is a complete flyod algorithm for computing. We can quickly analyze and solve the graph theory through flyod.
tuge-v
- 这个是基于图论的分割算法，是根据一篇sic编的，效果值得信赖-This is a compilation of matlab m file with the graph cut algorithm is based on a paper series, the effect trustworthy
图的广度优先遍历
- 实现图的广度优先遍历程序，c语言编程，图论(A program for realizing the breadth first traversal of a graph)