Search - graph - CodeBus

Search - graph - List

[Documents] icon DL : 0: 图标大全，各种绘图图表，种类多，样式全- Chart sign greatly entire, each cartography graph, the type are many, style entire
Date : 2026-01-01 Size : 191kb User : 刘玉芳
[Documents] Prim DL : 0: 最小生成树是数据结构中图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通...为了得到最小生成树,人们设计了很多算法,最著名的有prim算法和kruskal算法。-Minimum spanning tree data structure is an important application of graph, and its request is from a weighted undirected complete graph to select n-1 edges and the graph is still connected ... in order to get minimum spanning tree, it is designed a lot of algorithms, the most famous are prim algorithm and Kruskal algorithm.
Date : 2026-01-01 Size : 1kb User : 0000
[Documents] levelset DL : 1: 水平集方法及其在图像分割上的应用,对水平集方法的原理进行了比较详细的阐述,并将其应用于图分割-Level Set Method and Its Application in Image Segmentation on the application of the principle of level set methods have been fairly detailed, and applied to graph partitioning
Date : 2026-01-01 Size : 235kb User : 万成凯
[Documents] tudebianli DL : 0: 一、程序分析 1．以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。 2．设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。 3．问题描述： 4．以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。 -First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Description: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
Date : 2026-01-01 Size : 19kb User : 姚晶晶
[Documents] basicAlgorithm(pascal) DL : 0: 基本算法正稿包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、树的遍历；七进制转换；八全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory algorithm III knapsack problem four, sorting algorithm five, high-precision calculation six, tree traversal seven hexadecimal conversion eight wide array and combination generation 9. Search algorithm 10, greed 11, backtracking framework 12, DFS framework 13, BFS framework 15, data structure-correlation algorithm
Date : 2026-01-01 Size : 14kb User : oh204
[Documents] svdthesis.pdf DL : 0: GRAPH CLUSTERING by FLOW SIMULATION.pdf
Date : 2026-01-01 Size : 3.33mb User : jzw
[Documents] tdyy DL : 0: 很多涉及图上操作的算法都是以图的遍历操作为基础的。试编写一个算法，实现图的深度优先和广度优先搜索遍历操作-Many involved in the operation of the algorithm maps are based on graph-based traversal operation. The preparation of a test algorithm, the realization of plans and the depth-first breadth-first search traversal operation
Date : 2026-01-01 Size : 9kb User : 李鹏飞
[Documents] match DL : 0: 详细介绍了二分图匹配，值得一看。尤其是搞大学生程序设计竞赛的，更值得一看。-Detailed information on bipartite graph matching, worth a visit. In particular, engage in Collegiate Programming Contest, and more worth a visit.
Date : 2026-01-01 Size : 169kb User : 吴索铸
[Documents] jfreeChart DL : 0: 使用JfreeChar进行统计产生饼图，柱形图，等所开发当中的总结-The use of statistics generated JfreeChar pie chart, bar graph, and developed a summary of which
Date : 2026-01-01 Size : 80kb User : anfy1982
[Documents] hamilton DL : 0: 介绍了几种找出各种图中所有hamilton回路的算法。-Introduce a number of identifying all the hamilton circuit diagram of the algorithm.
Date : 2026-01-01 Size : 1.23mb User : crayon
[Documents] Steiner+tree DL : 0: steiner树的文章和实现,这个东西写的很详细在图论中很有用处-Steiner tree of the articles and realized this thing written in great detail in graph theory is very useful
Date : 2026-01-01 Size : 1.91mb User : 27077
[Documents] 2007 DL : 1: 目的与要求：本设计的目的是通过对死锁检测算法的模拟，来了解死锁检测中的数据结构的设计和使用以及资源分配图在死锁检测中的应用。具体要求如下： ⑴模拟一个死锁检测算法； ⑵该算法能通过简化资源分配图来检测死锁； ⑶资源分配图可以用矩阵的形式表示； ⑷输出结果为有死锁或无死锁。 -Purpose and requirements: The purpose of this design is the deadlock detection algorithm through the simulation, to understand the deadlock detection data structure, as well as the design and use of the resource allocation map in the deadlock detection. Specific requirements are as follows: ⑴ simulated a deadlock detection algorithm ⑵ The algorithm can simplify the allocation of resources to detect the deadlock graph ⑶ resource allocation plan can be expressed in the form of matrix ⑷ output for the deadlock or deadlock-free.
Date : 2026-01-01 Size : 72kb User : bbsky
[Documents] mapbase DL : 0: 图论的一些基本思想，以及一些巧妙的算法和思维-Graph theory, some basic ideas, as well as some clever algorithms and thinking
Date : 2026-01-01 Size : 575kb User : liyi
[Documents] BCS DL : 0: 压缩传感是一个从2006年左右开始兴起的研究领域，它关注于如何采样信号，也就是信号的采样方式或者压缩方式。通过设计一种特殊的采样方案，可以使得采样频率降低为信号的“信息率”，而不是传统的奈奎斯特采样率，于是，实际的采样率可以大大低于奈奎斯特频率，却只损失很少的信息量，依然保持了充足的信息量足以恢复出采样前的原始信号。这个研究思想挑战了奈奎斯特频率的理论极限，会对整个信号处理领域产生极其深远的影响，同时，信号处理的许多应用领域也会随之发生根本性的发展和变化。 -Compressive sensing (CS) is an emerging ﬁ eld based on the revelation that a small collection of linear projections of a sparse signal contains enough information for sta- ble, sub-Nyquist signal acquisition. When a statistical characterization of the signal is available, Bayesian inference can complement conventional CS methods based on linear programming or greedy algorithms. We perform approximate Bayesian infer- ence using belief propagation (BP) decoding, which represents the CS encoding matrix as a graphical model. Fast encoding and decoding is provided using sparse encoding matrices, which also improve BP convergence by reducing the presence of loops in the graph. To decode a length-N signal containing K large coeﬃ cients, our CS-BP decoding algorithm uses O(K log(N)) measurements and O(N log2 (N)) computation. Finally, sparse encoding matrices and the CS-BP decoding algorithm can be modiﬁ ed to support a variety of signal models and measurement noi
Date : 2026-01-01 Size : 234kb User : romman
[Documents] Listofthemapcoloringdyeingandoptionalfullarticle.z DL : 0: 图的列表染色、全染色和可选择性是当今图论的重要问题。-Chart a list of dyeing, the dyeing and optional graph theory in today' s important issues.
Date : 2026-01-01 Size : 2.15mb User : 陈广军
[Documents] cut DL : 0: image segmentation: introduction of graph cut, grab cut, normalize cut,-image segmentation: introduction of graph cut, grab cut, normalize cut,...
Date : 2026-01-01 Size : 11.75mb User : Yun-Ru Sun
[Documents] S7_GRAPH DL : 0: S7 Graph Design for step 7 Siemens
Date : 2026-01-01 Size : 513kb User : dalbix
[Documents] Bipartite-graph-matching DL : 0: 自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
Date : 2026-01-01 Size : 453kb User : 吕敏敏
[Documents] Graph-Cut DL : 0: 详细介绍了图割算法的原理和过程，最终得到深度图。-High Quality Depth Map Estimation Method Based on Graph Cut
Date : 2026-01-01 Size : 1.33mb User : BOY
[Documents] A-Graph-Based-Routing-Algorithm-for-Multi-hop-Cog DL : 0: Graph Theory in Cognitive Radio Networks
Date : 2026-01-01 Size : 270kb User : Harish

« 12 3 »