Search - graph

Search - graph - List

【JSP/Java】 PRIM_MST DL : 0: 用java实现了最小求解连通图的最小生成树问题，采用的是prim算法，可供大家参考。-Using java realize the smallest connected graph for solving the minimum spanning tree problem, is the prim algorithm used for your reference.
Update : 2024-05-15 Size : 4096 Publisher : gengxin
【matlab】 graph_theory DL : 0: 介绍了图论一些经典算法并且举例说明了matlab编程实现-Introduced a number of classical graph theory algorithms and matlab programming examples realize
Update : 2024-05-15 Size : 47104 Publisher : 林玉彬
【GUI Develop】 graph DL : 0: 数学画图，输入函数画函数图。自由下载-Mathematical drawing, painting function map input function. Free download
Update : 2024-05-15 Size : 236544 Publisher : 钟鹏
【3D Graphic】 MATLAB DL : 0: matlab图像处理，进行左右两图的匹配，有图像载入界面，匹配实现方便-matlab image processing, for about two graph matching, has image loading interface, matching the achievement of convenience
Update : 2024-05-15 Size : 196608 Publisher : eccbbc
【Data structs】 datastructure DL : 0: 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing
Update : 2024-05-15 Size : 1383424 Publisher : lindaoming
【AI-NN-PR】 simulate_anneal DL : 0: 用mathlab编写的经典的模拟退火应用程序，包括图着色问题，最大截问题等-Mathlab prepared to use the classic simulated annealing applications, including graph coloring problem, the largest cut-off problems
Update : 2024-05-15 Size : 15360 Publisher : xianyan
【Special Effects】 cut DL : 0: 完成计算机图形学中图形的裁剪，首先绘制四边形，然后绘制直线，将四边形外的部分裁剪掉。-Completion of computer graphics in the cut graph, first of all draw quadrilateral, and then draw a straight line will be outside the quadrilateral part of cutting out.
Update : 2024-05-15 Size : 1627136 Publisher : rebecca
【VC/MFC】 boost_graph_library DL : 0: 关于boost graph library的文档，值得好好研究一下-Boost graph library on the document, it is worth a good look
Update : 2024-05-15 Size : 1174528 Publisher : hahaha
【Communication-Mobile】 Girth-eightQC-LDPC DL : 0: The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transformed into a matrix. girth of eight is maintained by avoiding six-cycles in the graph construction
Update : 2024-05-15 Size : 2048 Publisher : 古立峰
【Graph program】 SegmentVideo.tar DL : 0: 图像分割元代码，对大部分人学习图割算法进行了实现-Image segmentation element code, for most people to learn graph cut algorithm to achieve
Update : 2024-05-15 Size : 45056 Publisher : 夜水晶
【Other】 graph_theory DL : 0: 图论的经典教程《图论及其应用》邦迪著的中文版-Graph Theory Tutorial classic
Update : 2024-05-15 Size : 3675136 Publisher : 苏加诺
【CSharp】 Telerik.WinControls.RadChart DL : 0: r.a.d.chart是一个完全可自定义的图表控件，可以显示复杂的图形数据，该产品提供4种基本类型的图表 – 饼状图（Pie）, 条状图（Bar）, 线形图（Line）,和范围图（Area），每一个都可以被充分的定制，r.a.d.chart能够帮助您更加人性化地表现和利于领会复杂的数据 -radchart is a completely customizable chart control, can display complex graphics data, the product provides four kinds of basic types of charts- Pie Chart (Pie), Bar (Bar), line graph (Line), and the scope of Map (Area), each one can be fully customized, radchart can help you more humane and beneficial to understand the performance of complex data
Update : 2024-05-15 Size : 546816 Publisher : ljh
【Special Effects】 graphCuts DL : 0: 基于Graph Cuts计算机视觉立体视图匹配算法-Computer Vision Graph Cuts Based on three-dimensional view matching algorithm
Update : 2024-05-15 Size : 7168 Publisher : li fei
【Data structs】 Bipartite DL : 0: 图论*匈牙利算法的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,
Update : 2024-05-15 Size : 3072 Publisher : jiangxr
【matlab】 biMatichHungary DL : 0: 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm description completely according to the use of computing to achieve a collection of matlab code. Here we need to discuss is the way to broaden the selection of the algorithm, a lot of friends who wish to discussions in order to find a better way to broaden the way, there is a certain mind to tell me, thank you, jxrhhu@hhu.edu.cn
Update : 2024-05-15 Size : 1024 Publisher : jiangxr
【Data structs】 C DL : 0: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Update : 2024-05-15 Size : 15360 Publisher : 海霞
【DirextX】 DirectShow-src DL : 0: DirectShow开发指南》源码 Chapter04：第4章用到的代码，其中AppIPTransform为MFC Filter的例子， DsDemo是一些演示代码，FilterTitleOverlay是字符叠加Filter的源代码。 Chapter05：第5章用到的代码，其中GraphBuilding为Filter Graph构建技术的一些代码，SimplePlayer为一个简单的播放器例子。 Chapter07：第7章用到的代码，其中DsDemo是一些演示代码。 Chapter09：第9章用到的代码，其中DESCallback演示了控制DirectShow智能连接的方法。 Chapter18：第18章用到的代码，其中MpegNetwork为“MPEG流的网络客户端播放”实现的所有源代码（请打开Daisy.dsw浏览各项目）。 Chapter19：第19章用到的代码，其中DVD2AVI_1.77.3_SRC.zip为开放源码， FilterMpeg2VD为此开放源码基础上开发的MPEG-2 Video Decoder Filter例子。除上述代码外，本书各章用到的其他代码均在DirectX SDK安装目录的 Samples子目录下可以找到。-err
Update : 2024-05-15 Size : 7292928 Publisher : zhomec
【GUI Develop】 test DL : 0: 这是学习GRAPH CUTS的重要代码，为初学者打开门户，一边更好的掌握-This is an important learning GRAPH CUTS code, open the door for beginners, while a better grasp
Update : 2024-05-15 Size : 609280 Publisher : 夜水晶
【Data structs】 Hungary DL : 0: 匈牙利算法实现二分图最大匹配文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
Update : 2024-05-15 Size : 1024 Publisher : 武永基
【Data structs】 Graph DL : 0: 是一个在学习数据结构时编写的图结构，主要是用两种方法生成需要的图结构，其中有一个头文件都注释了，要是要使用的话，只需要将另一个头文件注释并把这个取消注释，在main方法中改一个类名就好了-Is a data structure in the learning plan to prepare the structure, is mainly used two methods to generate the need for the graph structure, in which there is a header file are annotated, if you want to use words, just another header file to the Notes and the cancellation of Notes, in the main method to a class name like the
Update : 2024-05-15 Size : 7168 Publisher : 王龙飞

« 1 2 ... 8 9 10 11 12 1314 15 16 17 18 ... 50 »