搜索资源列表
FSofGragh
- 图论中关于简单无向图的深度，广度搜索，由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
path.cpp
- 试在虚基类Network中增加一个函数FindPaths，对于给定的无向图G 和G 中的2 个顶点v和w，输出G 中从v到w的一条简单路径。若有多条可能路径，则输出任意一条。 -test in the virtual base class to add a Network Function FindPaths. For a given undirected graph G and G, the two vertices v, w, output from the G v w to a si
bianli_loca
- 图的遍历，正常人和非正常人过河的问题，MFC界面，操作简单-graph traversal, normal and non-normal to cross the river, MFC interface, simple operation
Dijkstra.zip
- 一个用vc2005开发的C语言的dijkstra实现，相对简单图结构矩阵表示。,Vc2005 with the development of a C-language dijkstra to achieve a relatively simple graph structure matrix.
find_all_loops
- 找出有向图中所有简单回路，深搜DFS+标记-Directed graph to find all the simple loop, deep search DFS+ Tags
juzheng
- 图的邻接矩阵存储（数组表示）、简单输出。-Graph adjacency matrix storage (array, said), a simple output.
ani
- ： 移动机器人路径规划是机器人学的一个重要研究领域。 针对移动场地的特点对其进行了建 模与存储，然后将场地处理成简单的连通图-: Mobile robot path planning is an important study robot research field. Characteristics for mobile sites for their modeling and storage, and then deal with the venue into a simple con
RIPprogram
- a RIP distance vector implementation for a simple graph
Topsort
- 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下： （1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。 （2）从图中删除该顶点和所有以该顶点为头（尾）的弧。 -The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algor
code
- 学习数据结构时编写的有关二叉树基本运算实现，有向图和邻接矩阵，邻接表的转换，输出某矩阵转置矩阵的三元组以及两矩阵进行运算后结果用三元组表示，在学习VC程序设计写了一个简单的机场不同型号车辆的收费系统。-Learning data structures to prepare basic operations on binary tree realization of a directed graph and the adjacency matrix, adjacency list of the c
floyd
- floyd算法，用于图论中的最短路算法，使用matlab编写，简单实用-floyd algorithm for the shortest path in graph theory algorithms, using matlab to prepare, simple and practical
Graph
- 程序采用C++编写，在C++Builder6.0中编译通过，用于计算简单图结构的连通度和结合度。-Using C++ program written in C++ Builder6.0 in compiles, used to calculate the simple graph structure, degree of connectivity and integration.
tutorial_on_spectral_clustering
- In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algo
GraphCut_matlab
- graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic
isomap
- In statistics, Isomap is one of several widely used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional scaling). Isomap is used for computing a quasi-is
Graph-algorithms
- 图论算法。图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graph algorithms. Graph algorithms in computer science plays a very important role, it provides a lot of problems for a simple and effective w
database-Graph
- 一：实验目的： （1）掌握图的存储思想及其存储实现。 （2）掌握图的深度、广度优先遍历算法思想及其程序实现。 （3）掌握图的常见应用算法的思想及其程序实现。 （4）理解有向无环图、最短路径等算法 二：实验内容： 以下实验内容，1和2为必做内容，3为选做内容。 1.有向图 （1）键盘输入数据，建立一个有向图的邻接表，并输出该邻接表。 （2）在有向图的邻接表的基础上计算各顶点的度，并输出。 （3）以有向图的邻接表为基础实现并输出它的拓扑排序序
1273
- poj1273 一道网络流图论的简单题，运用增光路的算法-poj1273 a simple graph problem
matlab
- 该版本“最小路径”算法只能够完成寻找“简单图”、“无向图”的最短路。-This version of " minimal path" algorithm is able to complete only looking for " a simple graph," " undirected" most shorted.
data-sorting--Graph-Theory
- 介绍工程实用简单图论问题的并行算法及其MPI编程实现-MPI parallel programming algorithm and introduce practical engineering problems to achieve a simple graph theory