Description: 哈夫曼编/译码器
实现概要设计中定义的所有数据类型，对每个操作只需要写出伪码算法；对主程序和其他模块也都需要写出伪码算法(伪码算法达到的详细程度建议为：按照伪码算法可以在计算机键盘直接输入高级程序设计语言程序)；画出函数的调用关系图。-Huffman encoder / decoder design outline to achieve the definition of all data types, for each operation only needs to write pseudo-code algorithms; the main program and other modules are also required to write pseudo-code algorithms (pseudo-code algorithms to achieve the level of detail recommendations : According to pseudo-code algorithms in the computer keyboard can be imported directly Senior Program Design Language Program); paint function call graph. Platform: |
Size: 9931 |
Author:季舟 |
Hits:
Description: computing dense correspondence #
# (disparity map) between two images using graph cuts
This software implements stereo algorithms described in the following papers:
Vladimir Kolmogorov and Ramin Zabih
"Multi-Camera scene Reconstruction via Graph Cuts"
In: European Conference on Computer Vision, May 2002.
Vladimir Kolmogorov and Ramin Zabih
"Computing Visual Correspondence with Occlusions using Graph Cuts"
In: International Conference on Computer Vision, July 2001.
and
Yuri Boykov, Olga Veksler and Ramin Zabih
"Markov Random Fields with Efficient Approximations"
In: IEEE Computer Vision and Pattern Recognition Conference, June 1998.
Platform: |
Size: 1319269 |
Author:newship@126.com |
Hits:
Description: 哈夫曼编/译码器
实现概要设计中定义的所有数据类型，对每个操作只需要写出伪码算法；对主程序和其他模块也都需要写出伪码算法(伪码算法达到的详细程度建议为：按照伪码算法可以在计算机键盘直接输入高级程序设计语言程序)；画出函数的调用关系图。-Huffman encoder/decoder design outline to achieve the definition of all data types, for each operation only needs to write pseudo-code algorithms; the main program and other modules are also required to write pseudo-code algorithms (pseudo-code algorithms to achieve the level of detail recommendations : According to pseudo-code algorithms in the computer keyboard can be imported directly Senior Program Design Language Program); paint function call graph. Platform: |
Size: 9216 |
Author:季舟 |
Hits:
Description: 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现；
2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现；
-1) The master plan of the adjacency matrix, adjacency table, Cross linked lists, adjacency list multiple storage structure and express language to create algorithms realize c 2) grasp the depth-first search graph traversal algorithm and the graph breadth-first search traversal algorithm and C language Platform: |
Size: 36864 |
Author:ma |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm. Platform: |
Size: 105472 |
Author:陈阳 |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm. Platform: |
Size: 28672 |
Author:陈阳 |
Hits:
Description: 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth traversal traverse to attempt to grasp the basis of some commonly used algorithms, such as minimum spanning tree, topological sorting, shortest path and so on. Platform: |
Size: 253952 |
Author:胡顶豪 |
Hits:
Description: 经典算法包,内含多种(几何、结构、数论、数值计算、图论等)算法的实现代码的txt文件；以及关于算法的应用。-Classical algorithm package, containing a variety of (geometry, structure, number theory, numerical calculation, graph theory, etc.) algorithm code txt file and on the application of algorithms. Platform: |
Size: 81920 |
Author:小杰 |
Hits:
Description: 1. 设计数据结构；
2. 设计算法完成任意n阶魔方阵的填数；
3. 分析算法的时间复杂度
魔方阵，又叫幻方阵，在我国古代称为“纵横图”。它是在一个n*n的矩阵中填入1到n*n的数字(n为奇数)，使得每一行，每一列，每条对角线的累加和都相等。-Design data structure design algorithm to complete the fill in the number of arbitrary order n magic square time complexity of the analysis algorithms magic square, also known as the magic square, in ancient China known as the " aspect graph. It is to fill in a matrix of n* n n* n the number (n is odd), so each row, each column, each diagonal sum are equal. Platform: |
Size: 15360 |
Author:周琳 |
Hits:
Description: 本书分为 8 章，第 1 章介绍了数据结构和算法的基本概念及本书用到的数学和 C#的知
识；第 2 章至第 6 章分别讨论了线性表、栈和队列、串和数组、树型结构和图结构等常用的
数据结构及其应用，以及在.NET 框架中相应的数据结构；第 7、8 两章分别讨论了排序和查
找常用的各种方法及其应用以及在.NET 框架中相应的算法。-The book is divided into eight chapters, Chapter 1 introduces the basic concepts of data structures and algorithms, and the book is used in mathematics and knowledge of C# Chapter 2 to Chapter 6 discusses linear tables, stacks and queues, strings and the array of tree structure and graph structure commonly used data structures and their applications, as well as the corresponding data structures. NET Framework 7,8 two chapters discuss the sort and find used a variety of methods and their application, as well as algorithm. NET Framework. Platform: |
Size: 1354752 |
Author:王桢您 |
Hits:
Description: ，主要包括并行程
序设计基础（并行计算机系统与结构模型、ＰＣ机群搭建和并行程序设计简介等）、并行程序
编程指南（ＭＰＩ、ＰＶＭ、ＨＰＦ和ＯｐｅｎＭＰ等）和并行程序开发方法（可视化并行程序设计环境、
并行程序调试和并行程序性能分析及优化等）；下篇为并行算法编程实现，主要包括非数值
并行算法（排序、串匹配、图论、组合优化和计算几何等）及其ＭＰＩ编程实现和数值计算并行
算法（矩阵运算、线性方程组求解、矩阵特征值计算和傅氏及小波变换等）及其ＭＰＩ编程实
现。-, Main parallel programming foundation (parallel computer system with the structural model, PC cluster structures and parallel programming brief), Parallel Programming Guide (MPI, PVM, HPF and OpenMP, etc.) and the parallel program development approach (visual parallel programming environment, debugging of parallel programs and parallel program performance analysis and optimization, etc.) next parallel algorithm programming, including the non-numerical parallel algorithms (sorting, string matching, graph theory, combinatorial optimization, and computational geometry, etc.) and its MPI programming parallel algorithms and numerical calculation (matrix operations, solving linear equations, matrix eigenvalue calculation and Fourier and wavelet transform, etc.) and its MPI programming. Platform: |
Size: 2525184 |
Author:陈晓东 |
Hits:
Description: 联通图G的一个子图如果是一棵包含G的所有顶点的树，则该子图称为G的生成树 生成树是联通图的极小连通子图。所谓极小是指：若在树中任意增加一条边，则 将出现一个回路；若去掉一条边，将会使之编程非连通图。生成树各边的权 值总和称为生成素的权。权最小的生成树称为最小生成树，常用的算法有prime算法和kruskal算法。
-Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree, the subgraph Spanning Tree Spanning Tree called G Unicom Figure minimal connected subgraph. The so-called minimal means: any tree, add an edge, then a loop an edge if removed, will make the programming of non-connected graph. The sum of the weights of each edge of the spanning tree is called the right of erythropoietin. The right to the minimum spanning tree called the minimum spanning tree, commonly used algorithms prime algorithm and kruskal-algorithms. Platform: |
Size: 1024 |
Author:liming |
Hits:
Description: 数据结构
在图G中求一条从顶点i到顶点s 的简单路径。
实验目的：
1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构；
2、熟练掌握图的深度优先遍历和广度优先遍历算法；
3、在遍历算法的基础上设计其他应用算法。
-Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage structures, especially proficient adjacency matrix and adjacency list storage structure 2, master graph depth-first traversal and breadth-first traversal algorithm 3, the traversal algorithm based on the design of other applications algorithms. Platform: |
Size: 1024 |
Author:hank |
Hits:
Description: 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)
2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)
3 master depth-first search and breadth-first traversal traversal search algorithm
4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.
5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm. Platform: |
Size: 4096 |
Author:奋斗菠萝 |
Hits:
Description: 《算法精解:C语言描述》是数据结构和算法领域的经典之作，十余年来，畅销不衰！《算法精解:C语言描述》共分为三部分：第一部分首先介绍了数据结构和算法的概念，以及使用它们的原因和意义，然后讲解了数据结构和算法中最常用的技术——指针和递归，最后还介绍了算法的分析方法，旨在为读者学习《算法精解:C语言描述》打下坚实的基础；第二部分对链表、栈、队列、集合、哈希表、堆、图等常用数据结构进行了深入阐述；第三部分对排序、搜索数值计算、数据压缩、数据加密、图算法、几何算法等经典算法进行了精辟的分析和讲解。-" Fine solution algorithm: C language description" is a classic in the field of data structures and algorithms, more than ten years, sold briskly! " Fine solution algorithm: C language description" is divided into three parts: The first part introduces the concept of data structures and algorithms, as well as the causes and significance of using them, and then explain the data structures and algorithms most commonly used technique- Pointer and recursion, and finally introduced the analysis algorithm designed for readers to learn " fine solution algorithm: C language description" lay a solid foundation second part lists, stacks, queues, sets, hash tables, heap, Figure other commonly used data structures deeply elaborated third part of the sorting, searching numerical calculation, data compression, data encryption, graph algorithms, geometric algorithms and other classic algorithm incisive analysis and explanation. Platform: |
Size: 8270848 |
Author:李志轩 |
Hits:
Description: 算法竞赛入门经典（第二版） (算法艺术与信息学竞赛)
2014年6月第一次印刷
《算法竞赛入门经典(第二版)》是一本算法竞赛的入门与提高教材，把c/c++语言、算法和解题有机地结合在一起，淡化理论，注重学习方法和实践技巧。全书内容分为12 章，包括程序设计入门、循环结构程序设计、数组和字符串、函数和递归、c++与stl入门、数据结构基础、暴力求解法、高效算法设计、动态规划初步、数学概念与方法、图论模型与算法、高级专题等内容，覆盖了算法竞赛入门和提高所需的主要知识点，并含有大量例题和习题。书中的代码规范、简洁、易懂，不仅能帮助读者理解算法原理，还能教会读者很多实用的编程技巧；书中包含的各种开发、测试和调试技巧也是传统的语言、算法类书籍中难以见到的。
《算法竞赛入门经典(第二版)》可作为全国青少年信息学奥林匹克联赛（noip）复赛教材、全国青少年信息学奥林匹克竞赛（noi）和acm国际大学生程序设计竞赛（acm/icpc）的训练资料，也可作为it工程师与科研人员的参考用书。-Introduction to Algorithms (Second Edition) (algorithm art and informatics competition)
First printed in June 2014
Introduction to the classic algorithm (Second Edition) is an entry and improvement of teaching materials, the c/c++ language, algorithms and problem-solving organically combined together, dilute theory, focus on learning methods and practical skills. The book is divided into 12 chapters, including the introduction of program design, program design, cycle structure, function and recursive arrays and strings, c++ and STL entry, basis, method and data structure of violence efficient algorithm design, dynamic programming, preliminary mathematical concepts and methods, graph theory model and algorithm, advanced contents, main knowledge points cover the required entry and improve the competition algorithm, and contains a large number of examples and exercises. In the book, the code is simple and easy to understand, not only can help the reader understand the principle of the a Platform: |
Size: 9708544 |
Author:张甲林 |
Hits:
Description: 本书示例丰富，图文并茂，以让人容易理解的方式阐释了算法，旨在帮助程序员在日常项目中更好地发挥算法的能量。书中的前三章将帮助你打下基础，带你学习二分查找、大O表示法、两种基本的数据结构以及递归等。余下的篇幅将主要介绍应用广泛的算法，具体内容包括：面对具体问题时的解决技巧，比如，何时采用贪婪算法或动态规划；散列表的应用；图算法；K最近邻算法(This book is rich in examples, illustrations, and explains the algorithm in an easy-to-understand way designed to help programmers better harness the power of algorithms in their everyday projects. The first three chapters in the book will help you lay the groundwork, take you to the study of binary search, large O notation, two basic data structures, and recursion. The rest of this section will cover the most widely used algorithms, including: How to solve face-to-face problems, such as when to use greedy algorithms or dynamic programming; Hashtable applications; Graph algorithms; K nearest neighbor algorithms) Platform: |
Size: 16652288 |
Author:WFDDDYS |
Hits:
Description: 1、定义邻接矩阵存储的图类Graph_Matrix .
2、实验验证如下算法的正确性、各种功能及指标：
1）创建一个邻接矩阵存储的图；
2）返回图中指定边的权值；
3）查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号；
3、4）图的深度优先遍历；
5）基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix.
2. The experiment verifies the correctness of the following algorithms, various functions and indicators.
1) create a graph of adjacency matrix storage.
2) return map refers to the weight of dingbian;
3) find the first adjacency vertex of a vertex in a graph, and the next vertex sequence number of one vertex on another vertex;
3, 4) the depth first traversal of the graph;
5) prim algorithm for minimum spanning tree based on. [selected]) Platform: |
Size: 2328576 |
Author:kaiser1998 |
Hits:
Search - algorithms；Graph