Location:
Search - euler graph
Search list
Description: 一个很好的算法练习：
问题描述：对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路。
编程任务：对于给定的图G，编程计算图G 的双Euler 回路。
-a good algorithm practice : Problem description : for a given graph G, After map each side exactly two times the loop known as the G-Euler circuit. Programming tasks : for a given graph G, the program calculated the G-Euler circuit.
Platform: |
Size: 2406 |
Author: 韦国立 |
Hits:
Description: 用欧拉方法和龙格－库塔方法求微分方程数值解，画出解的图形，对结果进行比较分析。-using Euler method and RK method to solve the differential equations ,ploting the graph of the solution, compare and analyze the solutions
Platform: |
Size: 100352 |
Author: 葛林 |
Hits:
Description: 一个很好的算法练习：
问题描述：对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路。
编程任务：对于给定的图G，编程计算图G 的双Euler 回路。
-a good algorithm practice : Problem description : for a given graph G, After map each side exactly two times the loop known as the G-Euler circuit. Programming tasks : for a given graph G, the program calculated the G-Euler circuit.
Platform: |
Size: 2048 |
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: 对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路.-for the given graph G, the map after each side exactly two times the loop known as the G-Euler circuit.
Platform: |
Size: 1024 |
Author: 水若寒 |
Hits:
Description: 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-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 of the Euler diagram.
Platform: |
Size: 3072 |
Author: Jimmy |
Hits:
Description: 本课程为本专业(独立本科段)的一门专业基础课。课程内容为：命题逻辑和一阶谓词逻辑的基本概念和基本演算；集合的概念和运算、二元关系和函数；代数运算和代数系统的基本性质、半群和群、队和域、格和布尔代数；图的基本概念、树、欧拉图和哈密顿图、平面图、图着色、赋权图、二部图等。
通过本课程的学习，使应考者有抽象思维和逻辑推理能力，掌握计算机科学技术常用的离散数学中的概念、性质和运算。
自学教材：<<离散数学>>(全国考委组编)
左孝凌 主编 经济科学出版社
参考用书 ：<<离散数学>> 左孝凌等编 上海科技出版社 1982 -he major curriculum centered (independent undergraduate paragraph) of a major foundation courses. Curriculum content are: propositional logic and first order predicate logic the basic concepts and basic calculus collection of concepts and computation, binary relations and functions algebraic operations and the basic properties of algebraic systems, semi-groups and groups, teams and domain, grid and Boolean algebra map the basic concepts, trees, Euler and Hamiltonian graph map, plan, map coloring, weighted graph, etc. Figure 2.
Through the study of the curriculum so that candidates have abstract thinking and logical reasoning ability, computer science and technology have often used the concept of discrete mathematics, nature, and computing.
Self-study materials: <<Discrete Mathematics>> (全国考委Unit)
ZUO Xiao-Ling Economic Science Press editor-in-chief
Reference book: <<Discrete Mathematics>> ZUO Xiao-Ling et al 1982, Shanghai Science and Technology P
Platform: |
Size: 1098752 |
Author: alse |
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: 一个关于求有向欧拉图的算法实现，简单易行，可以借鉴。-An algorithm for directed-Eular Graph.
Platform: |
Size: 130048 |
Author: 阿牛 |
Hits:
Description: 图论课程设计 二部图 欧拉回路 呈上分享 希望有帮助-Graph theory, curriculum design, bipartite graph Euler circuit brought to share the hope that help
Platform: |
Size: 640000 |
Author: shamocanglang |
Hits:
Description: acm 模板，数论，图论，各种模板，最大字段和，N皇后模板，欧拉函数-acm templates, number theory, graph theory, a variety of templates, the largest field and, N Queen template, the Euler function
Platform: |
Size: 1314816 |
Author: endcorps |
Hits:
Description: 对欧拉图的判断，判断一个图是否是欧拉图并输出-Judgement of the Euler diagram to determine whether a graph and outputs Eulerian graph
Platform: |
Size: 1024 |
Author: wufei |
Hits:
Description: 欧拉图判定 有向图和无向图都可以实现，有操作文档说明。-to determine Euler diagram directed graph and undirected graph can be achieved, also there is an operational documentation .
Platform: |
Size: 258048 |
Author: |
Hits:
Description: 图论及应用 了解图的基本概念如树、图的连通性、Euler图、Hamilton图，以及图的匹配与因子分解，还有平面图和图的着色，有向图，图、群与矩阵-Graph theory and applications、 Euler Graph、 Hamilton Graph、Connectivity of Graph
Platform: |
Size: 1940480 |
Author: 梁赛赛 |
Hits:
Description: 计算机图论 中Euler circuit的算法实现-Computer graph theory Euler circuit algorithm
Platform: |
Size: 2048 |
Author: 小李 |
Hits:
Description: 欧拉回路，用于图论中的欧拉回求解，最大支持100个节点-Euler circuit for Euler graph theory back solving, maximum support 100 nodes
Platform: |
Size: 362496 |
Author: 李 |
Hits:
Description: provides path of all existing euler paths in a given non directional graph
Platform: |
Size: 8192 |
Author: nakul |
Hits:
Description: 给定一个无向图，找该图的欧拉环游。算法快可以执行好-Given an undirected graph, find the graph Eulerian tour. Fast algorithm can perform well
Platform: |
Size: 1024 |
Author: 付静 |
Hits:
Description: graph theory, C++, spanning tree, Euler, marching-graph theory, C++, spanning tree, Euler, marching...
Platform: |
Size: 6968320 |
Author: yh |
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: