搜索资源列表
oulat
- 欧拉图的使用，和它的源码，还有欧拉图的原理和解释，希望大家能用到-Graphs use, and its source code, there is a graph theory and explained that the hope that everyone can be
euro
- ＭＡＴＬＡＢ程序，用于计算图象中的欧拉数，简单实用-MATLAB procedures used in the calculation of the image Euler number, simple and practical
oulat
- 欧拉图的使用，和它的源码，还有欧拉图的原理和解释，希望大家能用到-Graphs use, and its source code, there is a graph theory and explained that the hope that everyone can be
matlabbasic5
- 计算图像中的欧拉数,用于图象检测和识别-calculated image of the Euler number of images for detection and identification, and so on
example
- 图象处理形态学应用：形态学梯度检测二值图像的边缘，形态学实例——从PCB图像中删除所有电流线，仅保留芯片对象，计算图像中的欧拉数 -Morphological image processing applications: morphological gradient detected binary image of the edge, morphology examples- from PCB image delete all c
graph
- 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-Map a series of nature, by entering the graph nodes and edges, the output map of various matrices, and to determine whether it was connected graph chart, such as the nature
algorithmcode
- 计算机算法程序，欧拉图，汉密顿回路，kruscal,红黑树，排序算法源代码。-Computer algorithm , Euler , Hamilton circuit, kruscal, red and black tree, sorting algorithm source code.
jsssc
- 街道洒水车问题（辅助路径寻找有向图的欧拉回路）
oula
- 随机生辰欧拉图，通过深度优先遍历来求欧拉回路-Random birthday Euler diagram, depth-first traversal through the pursuit of Euler circuit
EulerCircuit
- 实验报告 含代码 输入一个图G的N*N的邻接矩阵M,若G是欧拉图,则输出”图G是欧拉图” 否则,输出”图G不是欧拉图”-Enter the code lab report with a graph G, N* N adjacency matrix M, if G is the Euler diagram, then the output " Figure G is the Euler map" otherwis
Directed-Euler-Graph
- 一个关于求有向欧拉图的算法实现，简单易行，可以借鉴。-An algorithm for directed-Eular Graph.
fleury
- 用fleury算法计算一个欧拉图的穷举的方法 注意：w代表欧拉图矩阵 begin代表起点 只能是欧拉图！-Fleury algorithm using an exhaustive method of Euler diagram Note: w on behalf of the Euler diagram can only be a starting point matrix begin on behalf of the Euler di
Euler
- 对欧拉图的判断，判断一个图是否是欧拉图并输出-Judgement of the Euler diagram to determine whether a graph and outputs Eulerian graph
Euler-diagram
- 欧拉图判定 有向图和无向图都可以实现，有操作文档说明。-to determine Euler diagram directed graph and undirected graph can be achieved, also there is an operational documentation .
Eular-Graph
- 判断一个使用邻接矩阵储存的图是否是欧拉图的程序，使用C语言编写-failed to translate
matlab_gp.pdf.tar
- 可以将图论中的很多问题解决，比如说判断是否是连通图，是否是欧拉图等问题。-A lot of problems in graph theory can be resolved, for example, to determine whether it is a connected graph is Eulerian map.
Timus1129
- URAL大学的Online Judge,第1129题Door Painting，用C#实现，用到欧拉图的相关知识。-The the URAL University Online Judge, question 1129 Door Painting with a C# implementation, used Eulerian graph knowledge.
linjiejuzhen
- 使用邻接矩阵存储图并判断是否是欧拉图，最后打印图-Adjacency matrix storage map and determine whether it is Euler diagram, the final printing map
第05章 图与网络
- 图论起源于 18 世纪。第一篇图论论文是瑞士数学家欧拉于 1736 年发表的“哥尼 斯堡的七座桥”。 1847 年，克希霍夫为了给出电网络方程而引进了“树”的概念。 1857 年，凯莱在计数烷CnH 2n+2 的同分异构物时，也发现了“树”。哈密尔顿于 1859 年提 出“周游世界”游戏，用图论的术语，就是如何找出一个连通图中的生成圈、近几十年 来，由于计算机技术和科学的飞速发展，大大地促进了图论研究和应用，图论的理论和 方法
code
- 复杂网络中，判断一个图是否是连通图，是否是欧拉图，是否可图像化(In complex networks, judge whether a graph is connected graph, whether it is Euler diagram, and whether it can be graphical.)