搜索资源列表
Graph3
- 最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation
zhengxuan
- 这是正弦信号的图象，付氏变换，以及功率普密度分析，这是信道传输的基础-This is the image sinusoidal signal, Fourier transform, and the general power density analysis, this is the transmission channel basis
shengyuxian
- 这是升余弦滚降系统，包括时域波形，付氏变换，功率普分析，以及眼图，很有用的-Raised Cosine system, including time-domain waveform, Fourier transform, power & P analysis, and eye diagram, a very useful
4.67
- 普里姆算法构造最小生成树，无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
primandkruskal
- 普里母算法和克卢氏卡儿的关于求最短路径的无向图算法-Puri Cluj algorithm and the mother's card abuse on the shortest path algorithm undirected graph
tuxingshiyan
- 1）掌握图的邻接矩阵存储结构表示和与图创建算法的c语言实现； 2）掌握普里姆（Prim）最小生成树算法(P174:算法7.9)的C语言实现及应用； 3）验证如下图5-1所示无向网的最小生成树的正确性 4）按照实验题目要求独立正确地完成实验内容（提交程序清单及相关实验数据与运行结果）；
Prim.rar
- 用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树,With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
lorenzLya
- 利用正交向量法求Lorenz系统的李雅普诺夫指数，并绘出指数谱图。-Orthogonal Vector Method Lorenz system, Lyapunov exponent, and draw the index spectrum.
prim
- 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
prim
- 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
nonlinear
- 几个非线性系统学习的源码，包括李雅普诺夫指数，洛伦兹吸引子的画法，boost开关变换器，分叉图等等，适合非线性系统的学习仿真-Several of the source study of nonlinear systems, including Lyapunov exponents, Lorenz attractor painting, boost switching converter, bifurcation map, etc., suitable for simulation study
SpanningTree
- 先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔
pu
- 对右边的无向带权图，按普里姆算法求其最小生成树-On the right side of undirected weighted graph, by Prim algorithm to solve the minimum spanning tree
dsft
- 对于如图8.30所示的无向带权图G，采用普里姆算法输出从顶点0出发的最小生成树。-As shown in Figure 8.30 for the undirected weighted graph G, using Prim algorithm output starting from the vertex 0 the minimum spanning tree.
PrimAlgorithm
- 数据结构——邻接矩阵表示图，普里姆算法程序实现最小生成树-Data structure- adjacency matrix graph, Prim algorithm for minimum spanning tree procedure
prim
- 普利姆算法的C语言实现 采用图的数据结构-Plym algorithm using C language data structure diagram
Graph
- 图的操作，包括1.利用普利姆算法实现最小生成树； 2.利用克鲁斯卡尔算法实现最小生成树； 3.利用迪克斯特拉算法实现最短路径； 4.构建图形；-The chart operation, including 1. the algorithm realizes the smallest spanning tree using Pu Limb 2. algorithm realizes the smallest spanning tree using Crue the
普里姆算法最小生成树
- 数据结构之普里姆算法最小生成树（图的相关应用）(data structure of minimum spanning tree-using Prim(application og graph))
计算各种混沌系统李雅普洛夫指数的MATLAB 源程序
- 通过matlab仿真程序计算各种混沌系统李雅普诺夫的数值和图(Calculate the values and graphs of various chaotic system Lyapunov)
logistic映射的李亚普洛夫指数图
- 通过绘制李亚普洛夫指数图，来观察logistic映射的周期倍增规律。