Search - Euler circuit

Search - Euler circuit - List

[Other resource] 双Euler 回路问题 DL : 0: 一个很好的算法练习：问题描述：对于给定的图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.
Date : 2008-10-13 Size : 2.35kb User : 韦国立
[CSharp] EULER1 DL : 0: 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.
Date : 2008-10-13 Size : 60.57kb User : 无翼
[Other] euler2 DL : 0: 对于给定的图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.
Date : 2008-10-13 Size : 1.3kb User : 水若寒
[Other resource] eluercircle DL : 0: 欧拉回路源程序,欧拉回路源程序 -loop source Euler, Euler circuit source Euler circuit source
Date : 2008-10-13 Size : 5.75kb User : fdsafg
[Documents] 欧拉回路的程序和说明 DL : 0: 欧拉回路的算法和程序说明-Euler algorithm and circuit description of the procedures
Date : 2025-07-11 Size : 74kb User : 何蓥
[Data structs] 双Euler 回路问题 DL : 0: 一个很好的算法练习：问题描述：对于给定的图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.
Date : 2025-07-11 Size : 2kb User :
[CSharp] EULER1 DL : 0: 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.
Date : 2025-07-11 Size : 60kb User : 无翼
[Other] euler2 DL : 0: 对于给定的图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.
Date : 2025-07-11 Size : 1kb User : 水若寒
[Data structs] eluercircle DL : 0: 欧拉回路源程序,欧拉回路源程序 -loop source Euler, Euler circuit source Euler circuit source
Date : 2025-07-11 Size : 5kb User : fdsafg
[Other] youxiangtu DL : 0: 编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路：（1）如果为n阶，则随机产生一个n*n的邻接矩阵；（2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。-The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.
Date : 2025-07-11 Size : 90kb User : miao
[Other] Fleury DL : 0: 用C++实现的fleury算法查找欧拉回路，已经编译好，解压缩后可以直接运行-With C++ Realized fleury algorithm to find Euler circuit, has been compiled, and can be extracted directly run
Date : 2025-07-11 Size : 267kb User : 王文剑
[Other] algorithmcode DL : 0: 计算机算法程序，欧拉图，汉密顿回路，kruscal,红黑树，排序算法源代码。-Computer algorithm , Euler , Hamilton circuit, kruscal, red and black tree, sorting algorithm source code.
Date : 2025-07-11 Size : 9kb User : liuchang
[Windows Develop] Euler DL : 0: C++解欧拉回路问题，解决了简单的情况，可以解大多数情况-C++ solution of the Euler circuit problem, to solve a simple situation, possible solutions to the majority of cases
Date : 2025-07-11 Size : 566kb User : pf
[AI-NN-PR] oula DL : 0: 欧拉回路问题的求解，算法是删边，由于欧拉回路的算法较多，此为其中一个较为简单的-Euler circuit problem solving, algorithm is deleted edge, due to Euler circuit algorithm more, this is one of the more simple
Date : 2025-07-11 Size : 163kb User : 蒋军
[Windows Develop] a DL : 0: 欧拉回路算法实验代码判断是否为欧拉回路-Euler circuit algorithm to determine whether the experiment code Euler circuit
Date : 2025-07-11 Size : 679kb User : jhp627
[Graph Recognize] tulunkeshe DL : 0: 图论课程设计二部图欧拉回路呈上分享希望有帮助-Graph theory, curriculum design, bipartite graph Euler circuit brought to share the hope that help
Date : 2025-07-11 Size : 625kb User : shamocanglang
[Other] oular DL : 0: 实现一个简单的欧拉回路，是图论与代数的课程设计-A simple Euler circuit
Date : 2025-07-11 Size : 888kb User : lovestream
[Data structs] graphic DL : 0: 本压缩文件为完整的二分图最优匹配的KM算法程序和求有向图的欧拉回路的算法程序-KM algorithm and Euler circuit of Digraph
Date : 2025-07-11 Size : 2kb User : 榔头
[Fractal program] Euler-circuit DL : 0: 计算机图论中Euler circuit的算法实现-Computer graph theory Euler circuit algorithm
Date : 2025-07-11 Size : 2kb User : 小李
[Special Effects] Euler-circuit DL : 0: 欧拉回路，用于图论中的欧拉回求解，最大支持100个节点-Euler circuit for Euler graph theory back solving, maximum support 100 nodes
Date : 2025-07-11 Size : 354kb User : 李

« 12 3 »