搜索资源列表
实验4-微分方程
- 用欧拉方法和龙格－库塔方法求微分方程数值解，画出解的图形，对结果进行比较分析。-using Euler method and RK method to solve the differential equations ,ploting the graph of the solution, compare and analyze the solutions
双Euler 回路问题
- 一个很好的算法练习： 问题描述：对于给定的图G，经过图中每条边恰好2 次的回路称为图G 的双Euler 回路。 编程任务：对于给定的图G，编程计算图G 的双Euler 回路。 -a good algorithm practice : Problem descr iption : for a given graph G, After map each side exactly two times the loop known as the G-Euler circuit. Progra
EULER1
- 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 条边，顶点编号为
euler2
- 对于给定的图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.
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
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 of the Euler diagram.
MessageBox
- The preparation of Euler circuit algorithm, bipartite graph of the curriculum design, implementation, use of credit to the path to achieve
Directed-Euler-Graph
- 一个关于求有向欧拉图的算法实现，简单易行，可以借鉴。-An algorithm for directed-Eular Graph.
tulunkeshe
- 图论课程设计 二部图 欧拉回路 呈上分享 希望有帮助-Graph theory, curriculum design, bipartite graph Euler circuit brought to share the hope that help
acmmoban
- acm 模板，数论，图论，各种模板，最大字段和，N皇后模板，欧拉函数-acm templates, number theory, graph theory, a variety of templates, the largest field and, N Queen template, the Euler function
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 .
Graph-theory-and-applications
- 图论及应用 了解图的基本概念如树、图的连通性、Euler图、Hamilton图，以及图的匹配与因子分解，还有平面图和图的着色，有向图，图、群与矩阵-Graph theory and applications、 Euler Graph、 Hamilton Graph、Connectivity of Graph
Euler-circuit
- 计算机图论 中Euler circuit的算法实现-Computer graph theory Euler circuit algorithm
Euler-circuit
- 欧拉回路，用于图论中的欧拉回求解，最大支持100个节点-Euler circuit for Euler graph theory back solving, maximum support 100 nodes
euler
- provides path of all existing euler paths in a given non directional graph
euler-algorithm
- 给定一个无向图，找该图的欧拉环游。算法快可以执行好-Given an undirected graph, find the graph Eulerian tour. Fast algorithm can perform well
Graph-algorithm-and-Matlab-program
- 求单源最短路径的Dijkstra算法的Matlab程序 求Euler回路的Fleury算法的Matlab程序 求最小生成树的Prim算法的Matlab程序 求Huffman树的Matlab程序 最大流算法Matlab程序 求任意两点间最短路的Floyd算法的Matlab程序 -Seeking single-source shortest path Dijkstra algorithm Matlab program Euler circuit Fleury seekin
Euler
- Euler theorem graph theory. by tangliang. Have input and output file.
Graph
- 图论程序：图的关联距阵，最小生成树，深度搜索，欧拉图，连通性，权值矩阵等，有GUI-The correlation of the graph, the minimum spanning tree, the depth search, the Euler diagram, the connectivity, the weight matrix, etc., with a GUI