搜索资源列表
Graph-Theory
- 图论，主要是TSP问题的解决方法，用C++实现的过程-Graph theory, mainly TSP solution to the problem, with the realization of the process C++
graph-theoretic-algorithm
- 关于图论算法的各种问题的matlab代码-Various questions about the graph theoretic algorithm of matlab code
graph-theory
- 数据结构图论问题，初学数据结构的学生可以通过这些简单的问题熟悉数据结构课程-Data structure graph theory problem, learning data structures for students through these simple questions can be familiar with the data structure courses
tulunzuiduanlumatlabcode
- 解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。-The best way to solve the shortest path problem in graph theory is- "Dijstra algorithm," by parsing instance model, the model describes the algorithm, expand, and g
math1
- 组合数学和图论中的概率方法 组合数学和图论中的概率方法.pdf-Combinatorics and graph theory probabilistic methods
zui-duan-lu-jing-
- 图论中最短路问题的MATLAB 程序实现-The shortest path problem in graph theory MATLAB program to achieve
GrTheory
- 图论matlab编程 包括图论的一些经典算法-GRTheroy Matlab Coding
MATLAB
- 主要介绍了各种图论算法及其他们的matlab程序实现，这本书很好的帮助了入门的新手学习图论算法.-Introduces a variety of graph algorithms and their matlab program, this book is a good help the novice learning graph theory algorithms.
matgraph
- matlab中的图论工具箱源代码。可以做深度优先搜索、DMP算法等等。-Matgraph which can be used on Matlab. A good tool to solve problem on graph theory.
tulunchengxu
- 有关图论的模型算法Matlab程序，对初学者有一定的帮助，具有参考价值。-About graph theory model algorithm Matlab procedures have some help for beginners, with a reference value.
CPPAlgorithm-examples
- 好用的c++算法实现，对图论，DFS框架，排序等算法的学习非常有用-Easy to use c++ algorithms, graph theory, DFS frame, sorting algorithms, such as learning useful
Multi-hop-Cooperative-MIMO
- 在GM-MIMO集群建立基于地理位置。GM-MIMO图论应用于找到一个最佳的转发路径。-In GM-MIMO cluster is established based on geographic location. GM-MIMO graph theory applied to find the best path forward.
zuoye8_graph
- 关于数据结构中的图论的作业-Graph theory work on the data structure. . . . . . . . . .
NCUT
- 基于NCUT的综述，适合初学者了解Ncut，以及了解基于图论的图像分割方法。-descr iption for Ncut，useful to someone。
Interactive---image-segmentation
- 本文提出的超像素渐进合并算法应用了图论的基本框架：一幅图像被映 射成一个加权的无向图，其中超像素被当作图中的顶点，而相邻超像素之间通过边 相连，由超像素间的相似度计算出相应边的权值，通过排序每次合并权值最小的两 个超像素。-Shot into a weighted undirected graph, including super pixels as the vertices in the graph, and the adjacent pixels by boundary betw
matgraph
- matlab的复杂网络的工具箱的说明书文件matgraph图论工具箱使用说明-matgraph tool paper
graph
- 有关图论的知识，讲解比较基础，适合初学者-Knowledge about graph theory to explain the basis for comparison, suitable for beginners
tulun
- 在上传的资料‘tulun’中，PPT详细介绍了图论中的基本概念，并且给出了相应程序的算法，另外附有最短路Floyd算法的源程序和dijkstra的源程序。有利于在建模过程中利用MATLAB求解图论的相关问题。-PPT paper introduces the basic concepts of graph theory, algorithms and gives the corresponding program.Floyd also accompanied by the shortest ro
Hungary-algorithm
- “匈牙利算法”可以用于求解多种形式的指派 问题,其基本思想是寻找独立1元素组,而独立1 元素组与图论中对集是一个等价概念,所以与图论中求解赋权二分图最优对集、最大对集的思想是一脉相承的。 -Hungary algorithm
DAIMA
- 代码是图论最短路径Dijkstra的c++代码.还有常见的排序法的代码-Code is the shortest path graph Dijkstra c++ code. There are common sorting code