Location:
Search - euler path
Search list
Description: Euler 回路问题
.问题描述：
对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次
的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。
.编程任务：
对于给定的图G，编程计算图G 的一条Euler 回路。
.数据输入：
由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个
顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示
图G 的一条边(u,v) 。
.结果输出:
将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Platform: |
Size: 62019 |
Author: 无翼 |
Hits:
Description: Euler 回路问题
.问题描述：
对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次
的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。
.编程任务：
对于给定的图G，编程计算图G 的一条Euler 回路。
.数据输入：
由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个
顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示
图G 的一条边(u,v) 。
.结果输出:
将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Platform: |
Size: 61440 |
Author: 无翼 |
Hits:
Description: 用C++实现的fleury算法查找欧拉回路，已经编译好，解压缩后可以直接运行-With C++ Realized fleury algorithm to find Euler circuit, has been compiled, and can be extracted directly run
Platform: |
Size: 273408 |
Author: 王文剑 |
Hits:
Description: The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
Platform: |
Size: 152576 |
Author: 小小 |
Hits:
Description: 欧拉路径的计算，一个用c语言小程序。图论中求欧拉路径的程序。-Euler path calculation, a small program of c language. Graph theory procedures Euler path.
Platform: |
Size: 1024 |
Author: dasy |
Hits:
Description: provides path of all existing euler paths in a given non directional graph
Platform: |
Size: 8192 |
Author: nakul |
Hits:
Description: 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms template (bipartite graph matching Hungarian algorithm, the minimum spanning tree the prime and kruskal algorithm, Dijkstra algorithm, two shortest path negative weight value side SPFA algorithm, Fig any two points on the shortest path Floy algorithms, network flow SAP algorithms, network maximum flow minimum cost algorithm multiplicative inverse gcd expansion algorithm, segment tree interval division statistical algorithms, the matrix of the n-th power of divide and conquer to solve the gcd algorithm, integer division problem, the minimum point of the function, decimal turn ACM algorithm, primes screening method solving and Euler function, fast mode algorithm, the string matching KMP algorithm, a dictionary full array algorithm, fast row, the sort of three dimensional)
Platform: |
Size: 18432 |
Author: 林云 |
Hits:
Description: SGU 101 Domino 题解
能否找一条欧拉路将所有边走一遍，输出路径-SGU 101 Domino problem solution will be able to find an Euler path all the edges go again, the output path
Platform: |
Size: 1024 |
Author: YuGao |
Hits:
Description: 求欧拉回路的思路：循环的找到出发点。从某个节点开始，然后查出一个从这个出发回到这个点的环路径。这种方法不保证每个边都被遍历。如果有某个点的边没有被遍历就让这个点为起点，这条边为起始边，把它和当前的环衔接上。这样直至所有的边都被遍历。这样，整个图就被连接到一起了。-Euler circuit idea: find the starting point of the loop. From one node, start, and then find a way back to this point from the ring path. This method does not guarantee that each side have been traversed. If there is a point to let this side is not traverse points as a starting point, this edge is the starting side and put it on the current loop interface. So until all edges are traversed. Thus, the entire graph is connected together on it.
Platform: |
Size: 16384 |
Author: 周鑫恺 |
Hits:
Description: 用于解决起点和终点非同一点的欧拉通路 一笔画问题程序。-Solve the start point and the end point are diffient point Euler path problem a stroke problem.
Platform: |
Size: 333824 |
Author: 张玉坤 |
Hits:
Description: 这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法-This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm
Platform: |
Size: 215040 |
Author: 张恒 |
Hits:
Description: 求单源最短路径的Dijkstra算法的Matlab程序
求Euler回路的Fleury算法的Matlab程序
求最小生成树的Prim算法的Matlab程序
求Huffman树的Matlab程序
最大流算法Matlab程序
求任意两点间最短路的Floyd算法的Matlab程序
-Seeking single-source shortest path Dijkstra algorithm Matlab program
Euler circuit Fleury seeking algorithm Matlab program
Seeking Prim minimum spanning tree algorithm Matlab program
Matlab program seeking Huffman tree
The maximum flow algorithm Matlab program
Seeking the shortest path between any two points of the Floyd algorithm Matlab program
Platform: |
Size: 10240 |
Author: liulang |
Hits:
Description: 实现欧拉路的判断,使用图的结构，根据深度优先搜索判断是否有欧拉路-euler path
Platform: |
Size: 1024 |
Author: Nathan |
Hits:
Description: 通过matlab代码，包含优化类的几个简单示例程序，是一种双隐层反向传播神经网络，本程序的性能已经达到较高水平，数值分析的EULER法，有PMUSIC 校正前和校正后的比较，脉冲响应的相关分析算法并检验，单径或多径瑞利衰落信道仿真。- By matlab code, Optimization class contains several simple sample programs, Is a two hidden layer back propagation neural network, The performance of the program has reached a high level, EULER numerical analysis method, A relatively before correction and after correction PMUSIC, Related impulse response analysis algorithm and inspection, Single path or multipath Rayleigh fading channel simulation.
Platform: |
Size: 10240 |
Author: jbicgk |
Hits:
Description: 解耦，恢复原信号，数值分析的EULER法，信号处理中的旋转不变子空间法，gmcalab 快速广义的形态分量分析，信号维数的估计，基于chebyshev的水声信号分析，是路径规划的实用方法，实现典型相关分析。- Decoupling, restore the original signal, EULER numerical analysis method, Signal Processing ESPRIT method, gmcalab fast generalized form component analysis, Signal dimension estimates, Based chebyshev underwater acoustic signal analysis, Is a practical method of path planning, Achieve canonical correlation analysis.
Platform: |
Size: 7168 |
Author: zyijrigd |
Hits:
Description: 大学数值分析算法，数值分析的EULER法，车牌识别定位程序的部分功能，采用的是脉冲对消法，滤波求和方式实现宽带波束形成，基于互功率谱的时延估计，是路径规划的实用方法，各种资源分配算法实现。- University of numerical analysis algorithms, EULER numerical analysis method, Part of the license plate recognition locator feature, It uses a pulse of consumer law, Filtering summation way broadband beamforming, Based on the time delay estimation of power spectrum, Is a practical method of path planning, Various resource allocation algorithm.
Platform: |
Size: 8192 |
Author: ytkxi |
Hits:
Description: 是路径规划的实用方法，本程序的性能已经超过其他算法，可以广泛的应用于数据预测及数据分析,包含CV、CA、Single、当前、恒转弯速率、转弯模型，表示出两帧图像间各个像素点的相对情况，预报误差法参数辨识-松弛的思想，用于建立主成分分析模型，数值分析的EULER法。- Is a practical method of path planning, This program has exceeded the performance of other algorithms, Can be widely used in data analysis and forecast data, It contains CV, CA, Single, current, constant turn rate, turning model, Between two images showing the relative circumstances of each pixel, Prediction Error Method for Parameter Identification- the idea of relaxation, Principal component analysis model for establishing, EULER numerical analysis method.
Platform: |
Size: 8192 |
Author: qygwde |
Hits:
Description: 一些自适应信号处理的算法，包含特征值与特征向量的提取、训练样本以及最后的识别，进行波形数据分析,是路径规划的实用方法，能量熵的计算，Matlab实现界面友好，数值分析的EULER法。- Some adaptive signal processing algorithms, Contains the eigenvalue and eigenvector extraction, the training sample, and the final recognition, Waveform data analysis, Is a practical method of path planning, Energy entropy calculation, Matlab to achieve user-friendly, EULER numerical analysis method.
Platform: |
Size: 6144 |
Author: ddsnaph |
Hits:
Description: 解耦，恢复原信号，阐述了负荷预测的应用研究,实现了对10个数字音的识别，多姿态，多角度，有不同光照,包括随机梯度算法，相对梯度算法，数值分析的EULER法，有借鉴意义哦，单径或多径瑞利衰落信道仿真。- Decoupling, restore the original signal, It describes the application of load forecasting, To achieve the recognition of 10 digital sound, Much posture, multi-angle, have different light, Including stochastic gradient algorithm, the relative gradient algorithm, EULER numerical analysis method, There are reference Oh, Single path or multipath Rayleigh fading channel simulation.
Platform: |
Size: 5120 |
Author: 胡毅 |
Hits:
Description: Finding the Euler path and cycle in Graph
Platform: |
Size: 1024 |
Author: Samir |
Hits: