搜索资源列表
C
- 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorit
graph
- 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency li
GCmex1.2.tar
- graph cut matlab and c++ code for graph analysis
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
graph
- 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorith
GraphCut
- 对Vladimir Kolmogorov，Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示，代码力求精简，可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
Graph
- 图的生成：创建，DJISKAL算法实现，连接矩阵的本地输入-Map generated: Create, DJISKAL algorithm, connectivity matrix of the local input
erbutu
- 这一代码应用最经典的二部图算法，稍加改动便可用于其它类似题目，希望有所帮助-The code of the most classic bipartite graph algorithm can be modified for other similar topic, hope that help
Directed-Euler-Graph
- 一个关于求有向欧拉图的算法实现，简单易行，可以借鉴。-An algorithm for directed-Eular Graph.
graph
- 本程序描述图的算法的表述，可以通过该程序学习图的程序设计-This procedure describes the graph algorithm representation, you can learn through the process of program design plan
Algorithms.In.C.3rd.Ed.Part5.Graph.Algorithms
- 经典算法书(中文版)。这一套算法系列书介绍了当今最重要的算法，共分3卷，这是第2卷（第五部分），集中讲解图算法。本书共有6章（第17章～第22章）。第17章详细讨论图性质和类型，第18章~第22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。-Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewi
Graph
- 路彦雄的可视化图论算法软件，可实现一般图论问题的求解，没有源代码。-Lu Yan Xiong graph algorithm visualization software that enables to solve the general problem of graph theory, there is no source code.
VB.triple.graph.algorithm.generate.rules
- VB三合一分形算法生成规则图形VB triple graph of fractal algorithm to generate rules-VB triple graph of fractal algorithm to generate rules
Complete-collection-of-algorithm
- 算法大全 全书分30章及2附录（在MATLAB中实现）对常用数学算法进行汇总介绍。 主要包括：线性规划、非线性规划、动态规划、图与网络、排队论、对策论、层次分析法、插值与拟合、数据的统计描述和分析、方差分析、回归分析、微分方程建模、稳定状态模型、常微分方程解法、差分方程模型、马氏链模型、变分法模型、神经网络模型、偏微分方程的数值解、目标规划、模糊数值模型、现代优化算法、时间序列模型、存贮论、经济与金融的优化问题、生产与服务运作管理中的优化问题、灰色系统理论及其应用、多元分析、偏最小二乘回归以
graph-algorithm
- 图论算法，包括最短路算法、最小生成树、图的连通性、网络流、匈牙利算法等等源码-graph algorithm
graph.tar
- IT'S A SOURCE CODE FOR VARIOUS GRAPH ALGORITHM IN C++