搜索资源列表
floyd
- floyd算法，用于图论中的最短路算法，使用matlab编写，简单实用-floyd algorithm for the shortest path in graph theory algorithms, using matlab to prepare, simple and practical
moment_plog_output
- 计算简支梁在多个集中力，均布载荷，力偶同时作用时的剪力，弯矩并绘制其图形-Simple beam calculations in a number of concentrated force, uniformly distributed load, Couple add at the same time, the shear stress, moment and draw its graph
youleyuan
- ⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 -⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions sto
matlab_Graphics_applications_1
- 分别给出了三角函数曲线（1）、三角函数曲线（2）、图形的叠加、双y轴图形的绘制、单个轴窗口显示多个图形、图形标注、条形图形、区域图形的matlab样例代码，简单实用。-Were given trigonometric curve (1), trigonometric curve (2), graphics overlay, double y-axis graph drawing, a single-axis window displays the number of graphics, grap
isomap
- In statistics, Isomap is one of several widely used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional scaling). Isomap is used for computing a quasi-is
Graph-algorithms
- 图论算法。图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graph algorithms. Graph algorithms in computer science plays a very important role, it provides a lot of problems for a simple and effective w
dijkstra-
- dijkstra算法的，比较简单。用于去图论路径最短值，会给出最短路径值和方案-dijkstra algorithm is relatively simple. For the shortest path to the value of graph theory, will give the shortest path values and programs
codes
- 图论中的floyd算法。简单的小程序，可以插入任何过程中，方便实用。-In graph theory algorithms. Simple procedure, you can insert any process, convenient and practical.
DrawCircle
- A simple function for drawing a circle on graph.
map-program
- 简单绘制出常见标准benchmark函数的二维网格图，清晰的看出函数的最优值和局部最优，是单峰还是多峰函数-Simple map out common standard benchmark function of two-dimensional grid graph, clear see function of the optimal value and local optimum, is unimodal or multimodal function
multi-relay-cooperative-communication
- This program describe a stimulation which is in Part 1: No-Relay Transmitted power. In part 2 Relay Transmitted Power (Two-hop transmission) and in Part 3: Plot the graph Simple Relay , No Relay , Optimum Power level-This program describe a stimula
Dijkstra
- Demonstration of Dijkstra s Minimum Distance Algorithm: DIJKSTRA is a MATLAB program which runs a simple demonstration of Dijkstra s algorithm for determining the minimum distance from one node in a graph to all other nodes. The program is mainly o
dag-svm
- 有向无环图程序，程序较为简洁，包含代码和简要说明。-Directed acyclic graph procedure is relatively simple, containing code and a brief descr iption.
matlab
- 该版本“最小路径”算法只能够完成寻找“简单图”、“无向图”的最短路。-This version of " minimal path" algorithm is able to complete only looking for " a simple graph," " undirected" most shorted.
Centrality-measures
- 文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。-1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centra
waynezhanghk-gactoolbox-53508ce
- Gactoolbox 工具箱，针对图的图聚类工具,克服一般聚类方法不能应用于图的缺点-Gactoolbox is a summary of our research of agglomerative clustering on a graph. Agglomerative clustering, which iteratively merges small clusters, is commonly used for clustering because it is conceptually s
matlab_examples
- matlab做图论分析的一些实例例证，可以对图论进行简单的帮助和说明。并有图论结果，和注释说明，方便对图论进行研究。-Matlab do graph theory analysis of examples, the graph theory can be simple to help and instructions. theory can help and instructions.
antenna
- 利用GUI制作另一个简单的多种常见天线方向图的二维和三维制图界面。适合初学者掌握GUI功能和天线基础。-A simple GUI for some common antenna direction graph with 2-dimension and 3-dimension.
MCS_parallel
- 平行板间粒子的蒙特卡罗模拟方法，用了2个电脑分别计算，可对比结果-he probability of failure of a simply supported beam is estimated by means of MCS. Two computations are performed: 1. Using simple MCS 2. Using parallel computing parpool Finally, a graph showing the failur
Lorenz
- This is a simple animated graph of Lorenz system.