搜索资源列表
scale_free
- Matlab 无标度网络 可以任意增加节点，边的数量-Matlab scale-free network nodes can be arbitrarily increased, the number of edges
ezwcodes
- EZW (Embedded Zerotrees of Wavelet Transforms) is a lossy image compression algorithm. At low bit rates (i.e. high compression ratios) most of the coefficients produced by a subband transform (such as the wavelet transform) will be zero, or very clos
dfs
- 先深搜索算法，图论的基础算法，用于遍历图中各点，图用点边集表示，以文件方式读入-First deep-search algorithm, graph theory based algorithm for traversing the graph, Figure with a set of edges that point to papers read
Prim
- 这是一个图论问题中最小生成树的一种构造算法。 按普里姆算法构造最小生成树的过程为：在所有“其一个顶点已经落在生成树上，而另一个顶点尚未落在生成树上”的边中取一条权值为最小的边，逐条加在生成树上，直至生成树中含有 n-1条边为止。 -This is a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree
knnLLR
- matlab knn图构建以及局部线性重构加权方法-graph construction of KNNG and locally linear reconstruction for weighting the edges of knng
kruskal
- K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树-K ruskal algorithm each time you select n-1 edges, using criteria of greed: from the left side, select a loop with no minimum spend has been selected to
prim
- 算法简介:Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O（|E|log|V|）-Introduction to Algorithms: Prim algorithm used to find the undire
Chan-Vese
- ACTIVE CONTOUR WITHOUT EDGES in matlab-ACTIVE CONTOUR WITHOUT EDGES in matlab
graph
- 数据结构实验六图的操作，在程序中提示输入的顶点数以及每两条边之间的权值，最后使用深度优先和广度优先算法实现遍历，同时构建最小耗费生成树的最小权值和路径。-Experimental data structure diagram of the operation of six, in the program prompts for the number of vertices and edges between every two weights, the final depth-first and
adjListGraph
- 本程序基于C++利用邻接链表实现了图的基本数据结构，有向图和无向图均适用，包含了图的存储，图的插入，图的删除等基本操作,可供数据结构学习之用。-This program realizes the class of graph using adjacent list. The fundamental function includes the storage of graph, inserting and removing edges from the graph, etc.
sigma-2-02
- Sigma (Pease, 2003) is an environment for creating, testing, modifying, and performing inference with ontologies. Please bear in mind, however, that Sigma is a work in progress with a few rough edges.-Sigma (Pease, 2003) is an environment for c
c_71
- 数据结构，无向图的创建，输入边数和顶点数，以及权值，-Data structure, the creation of an undirected graph, enter the number of edges and vertices, and the weights
sfr2
- SFR finiding edges to measeure sharpening Strength-SFR finiding edges to measeure sharpening Strength.....................................................................................................................................................
arith_code
- SFR3 a new generation to find edges to measure shrpenss coefficent-SFR3 a new generation to find edges to measure shrpenss coefficent.....................................................................................................................
guideformatlab
- This Filter provides a selective mean (averaging) lter. In contrast to the standard mean lter,it preserves edges better and is less sensitive to outliers(outliers are those that are not included in the measurement taking place.In this case aver
ROC-plot
- 试者工作特征曲线 （receiver operating characteristic curve，简称ROC曲线），又称为感受性曲线（sensitivity curve）。得此名的原因在于曲线上各点反映着相同的感受性，它们都是对同一信号刺激的反应，只不过是在几种不同的判定标准下所得的结果而已。接受者操作特性曲线就是以虚报概率为横轴，击中概率为纵轴所组成的坐标图，和被试在特定刺激条件下由于采用不同的判断标准得出的不同结果画出的曲线。-PLOTROC Plot receiver operating
tudebianlihezuixiaoshengchengshu
- 图的遍历和最小生成树.必须完成图的存储功能。图的输入可由命令行完成。按遍历到的先后顺序依次输出G中各结点内容。以文本形式输出生成树中各条边以及它们的权值。 -Graph traversal and minimum spanning tree must be completed to the storage capabilities of the map. Input to the graph can be command line to complete. Traverse to the s
kcsj
- 数据结构课程设计的，选存储结构,输入含n个顶点（用字符表示顶点）和e 条边的图G； (2)求每个顶点的度,输出结果； (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS)； (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS)； (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3)；否则输出信 息“无x”； (6)判断图G是否是连通图，输出信
11
- 对于一个连通图G，请采用深度优先搜索的方法，识别出该连通图的所有关节点。如下图所示。 输入：首先输入连通图G的结点个数n、边的个数m以及搜索的起始结点号，然后输入各边（u,v）； 输出：首先输出DFN和LOW数组的值，然后输出所有关节点。-For a connected graph G, use depth first search method, identify the connected graph all key points. As below. Input: first
LevelSet_CVkeyong
- 实现无边界主动轮廓，能够直接运行的，很好用。希望对大家有用-active contour without edges