Search - graph - CodeBus

Search - graph - List

[Fractal program] ising_model DL : 0: 给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用. -given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph - The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.
Date : 2008-10-13 Size : 1.11kb User : 为听
[Fractal program] work2z DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM / ICPC contest and the preparation of information, because the competit
Date : 2008-10-13 Size : 4.17kb User : kelly
[Fractal program] 图论matlab工具集合 DL : 0: 图论的matlab工具箱非常详细
Date : 2011-03-03 Size : 56.06kb User : prometheus
[Fractal program] ising_model DL : 0: 给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用. -given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph- The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.
Date : 2026-01-01 Size : 1kb User : 为听
[Fractal program] work2z DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Date : 2026-01-01 Size : 4kb User :
[Fractal program] Orientation DL : 0: 这是一个分辨图形对称度的参数。返回值为1，则对应图形为圆；其它图形都大于0，小于一。越接近1，则对称度越高。-This is a symmetry to distinguish graphics parameters. The return value is 1, then the corresponding graph for a round other graphics are greater than 0, less than one. The closer one, then the higher symmetry.
Date : 2026-01-01 Size : 1kb User : RL
[Fractal program] min_spintree DL : 0: 在给定的任意一个无向图中，利用反圈算法找出最小支撑树，得到一个图的连通性判断-Given an arbitrary undirected graph, the use of anti-loop algorithm to find minimum spanning tree, get a map to determine connectivity
Date : 2026-01-01 Size : 2kb User : yangchunyao
[Fractal program] fd3 DL : 0: 由给定的图形可以计算出该图形的分形维数。-Graphics from a given graph can be calculated from the fractal dimension.
Date : 2026-01-01 Size : 107kb User : lanfeng
[Fractal program] vrml DL : 0: 这是用java编写的分行图形很不错的，对于学习分行图形很有帮助-It is written in java branch of graphic is very good, very helpful for learning branch graph
Date : 2026-01-01 Size : 2kb User : king
[Fractal program] nauty24.tar DL : 0: 本程序用于找到一个图的所有自同构组，并能够检测两个不同的图是否同构-automorphisms graph
Date : 2026-01-01 Size : 703kb User : June
[Fractal program] Draw DL : 0: VC++绘制几何图形，并实现填充，这些几何图形主要有直线、椭圆、矩形，同时还可以设置线宽和填充色，画完图形点击油漆桶工具可填充所画图形中的闭合部分-VC++ to draw geometric shapes, and to achieve filling, these geometric shapes are a straight line, oval, rectangular, and also can set the line width and fill color, click the Paint Bucket tool drawing the graphics drawn by filling in the closed part of the graph
Date : 2026-01-01 Size : 29kb User :
[Fractal program] CPP DL : 0: 实验代码+实验册三角形、长方形、正方形和圆形。几何图形的类型可以通过构造函数或通过成员函数来设置。 -The triangle, rectangle, square and circle. Geometry graph type can through the constructor or through the member function to set.
Date : 2026-01-01 Size : 2.09mb User : 王
[Fractal program] Debug DL : 0: 分形图,点击可无限放大，这是很有名的一个分形图示例，是学习的好东西。-This is a fractal graph code,Click on the part of the unlimited nondestructive amplification and it s good to study.
Date : 2026-01-01 Size : 1.28mb User : 蒋强盛
[Fractal program] CPP-design-fractual-graph DL : 0: 用C++设计的二维三维分形图形程序，对研究分形的同学有很大的帮助.- design 2D and 3D fractal graphics program using C++, it have a great help for students on fractal study.
Date : 2026-01-01 Size : 6.08mb User : 陈月霞
[Fractal program] C_one DL : 0: 关联维数参数（嵌入维数和时间延迟）的计算。读取txt波形数据，绘制图形，利用CC方法分析图形的的嵌入维数和时间延迟-The correlation dimension parameters (embedding dimension and time delay) calculation. Read txt waveform data, draw pictures using the CC method to analyze the graph of the embedding dimension and time delay
Date : 2026-01-01 Size : 1kb User : yihanerhan
[Fractal program] Euler-circuit DL : 0: 计算机图论中Euler circuit的算法实现-Computer graph theory Euler circuit algorithm
Date : 2026-01-01 Size : 2kb User : 小李
[Fractal program] dominantSetClustering DL : 0: 图论中寻找主集的相关matlab代码，图像处理的基本概念-The basic concepts of graph theory to find the main set matlab code, image processing
Date : 2026-01-01 Size : 1kb User : yvonne
[Fractal program] Graph DL : 0: 对图的深度，广度遍历，关键路径算法，最短路径算法实现，求生成树的深度及叶子结点数-Depth, breadth traversal, critical path algorithm, the shortest path algorithm, find the depth of the spanning tree and leaf nodes
Date : 2026-01-01 Size : 1.47mb User : zijian
[Fractal program] tulun-Prim_Dijkstra DL : 0: matlab实现图论中的Prim算法,Dijkstra算法,注释清晰，另外附有报告。-matlab realize Prim algorithm of graph theory, Dijkstra algorithm, clear notes and reports.
Date : 2026-01-01 Size : 578kb User : 罗琦琦
[Fractal program] LEAST-SQUARE-AND-GRPH-DRAWING DL : 0: 利用最小二乘法拟合直线和曲线，绘制出对比图形；简单绘制多种三维图形的代码-least-square fiting and draw graph
Date : 2026-01-01 Size : 2kb User : lipingyang

« 12 »