搜索资源列表
project1
- Strongly connected components of a graph + euler tour-Strongly connected components of a graph+ euler tour
Directed-Euler-Graph
- 一个关于求有向欧拉图的算法实现，简单易行，可以借鉴。-An algorithm for directed-Eular Graph.
eluier_circuit
- 欧拉回路的c语言求解,可自行选择有向和无向图-Euler solved the c language, you can choose to own and undirected graph
Euler
- Euler theorem graph theory. by tangliang. Have input and output file.
oula
- 对于给定的图通过遍历判定是否为欧拉图或者半欧拉图，并给出度数-For a given graph determine whether the Euler diagram or by traversing half Euler diagram and give degrees
ola
- 判断是否为连通图，欧拉图，求其无相连通矩阵并求欧拉回路-To determine whether the connected graph, Euler diagram, find the matrix without communicating and seeking Euler
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
code
- 复杂网络中，判断一个图是否是连通图，是否是欧拉图，是否可图像化(In complex networks, judge whether a graph is connected graph, whether it is Euler diagram, and whether it can be graphical.)