搜索资源列表
Graph
- 实现两个光源的场景模拟，使用Z扫描线算法渲染，包括计算机图形学中的多这个算法实现。带报告-Realize the two scenes of simulated light source, the use of Z scan line algorithm for rendering, including computer graphics in many realize this algorithm. With report
graph
- 用MFC做的绘图程序，里面的画线算法，画圆算法，梁友栋算法，扫描线种子填充算法等等都是严格按照书本的编写，适合学计算机图形学的初学者参考-Using MFC to do the drawing program, draw lines inside algorithm, drawcircle algorithm, You-Xin Liang Dong algorithms, scan line seed fill algorithm and so on are all in strict acco
adaptive
- adaptive threshold for liver segmentation project through graph cut algorithm
Graphtheory_typicalalgorithm
- 本书介绍了有关图论的基本概念和典型的图论算法，结合历届赛题分析如何把一个实际问题抽象化为数学中的图论问题，并给出了程序解法。本书的特点是既有基本概念的讲解及对所解问题的分析，又有编程的思路与参考程序。 本书是参加奥林匹克竞赛学生的必读书，也可作为大学生的参考书。 -This book introduces the basic concepts of graph theory and graph theory, a typical algorithm, combined with analys
theroy
- 数据结构算法解析第七章图论的程序源码 -Data Structures Algorithm Analysis Chapter VII of the source graph theory procedures
graph
- 直接使用windows API写的，绘制直线的算法的展示，以十倍大小显示-Direct use of the windows API to write and draw a straight line of the display of the algorithm to ten times the size of display
Adjacencylisttraversal
- 遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.
algorithm
- 一些算法的实现，用的是pascal，包括数论、图论、高精度计算、排序算法、背包问题等。-The realization of a number of algorithms, using the pascal, including number theory, graph theory, high-precision computing, sorting algorithms, and so on knapsack problem.
Graph
- 实现DDA算法画线，以及中点画圆的算法程序。好可以根据喜好选择颜色进行画-DDA line drawing algorithm to achieve, as well as the mid-point of the algorithm drawcircle procedures. Good can choose the color for painting
M
- Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
graph
- c++实现的图基础算法的包装类，提供了关于图的一些基础操作-c++ to achieve the plan based on the packaging type of algorithm provides a foundation on the map operation
LL_Path_optimization
- 【系统功能】 LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。 【主要算法】 1：利用Prim算法求解带约束条件的连通图的最小生成树； 2：利用基于单亲遗传算法求解带约束条件的TSP问题。 -【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest p
ex5a
- 建立一种可以区分输入图形的形态学算法，算法的输入是这三种图形的一种（这三个图形是对湖、湾、路段的图像细化后的结果），输出是对这三种图形的识别。假设这三种图形都是1个像素宽且完全连通的，然而它们出现的方向可以是任意的。-Can establish a distinction between the morphology of the importation of graphics algorithm input is a graph of these three (the three graphi
algorithm
- C、C++算法，数论算法、图论算法、各种排序算法，-C, C++ algorithms, number theory algorithms, graph theory, algorithms, a variety of sorting algorithms, etc.
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
Graphestp3
- algorithm des graph -algorithm des graph !!!!!!!!!!!!!!!!!!!!!
Kruskal
- 本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译，可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the gre
segmentation
- This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited
C
- C编程 完美数值算法 经典的数据结构算法，包括数论算法，图论算法，背包问题等-C programming classic numerical algorithm perfect data structure algorithms, including number theory algorithms, graph theory, algorithms, and so on knapsack problem