搜索资源列表
AnExperimentalComparisonOfModernMethodsOfSegmentat
- 本文主要是比较图论分割和主动轮廓分割算法，通过实验可以看出分割的好坏-This article is to compare the segmentation and active contour graph partitioning algorithm, Experimental results show the good and bad segmentation
Serialport
- 串行口与pc通信，内含程序和仿真图，可以显示出来-Pc serial port and communications, containing procedures and simulation graph can be displayed
ggg
- 基于图论的搜索有功输电断面的研究 -Search based on graph theory section of active transmission of search based on graph theory section of active transmission
000_privGraph.pdf
- Privacy and Anonymity in Graph Data
cxx6
- 准是指同一区域内以不同成像手段所获得的不同图像图形的地理坐标的匹配。包括几何纠正、投影变换与统一比例尺三方面的处理。在多时相、多信息的复合综合分析时常需... -Standard is the same region acquired by different imaging methods of different geographic coordinates of the image graph matching. Including geometric correction, proj
093CHPI0392045-001.ZIP
- Rectilinear Steiner tree is a graph constructed by line segments along the horizontally and vertically directions
Integrationtesting
- 集成测试PPT 单锦辉 北京大学软件研究所 内容 集成测试的必要性 集成测试的方法 • … 基于分解的集成 • … 基于调用图的集成 • … 基于路径的集成 案例研究 -Integration testing PPT single Jinhui Institute of Software, Peking University, the need for content integration testin
Deikstra
- For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.
lcdgraph
- LCD graph representation information with microcontroller
01259361tubianlideyanshi
- 图的遍历的演示（c 语言 数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i<=n i++) { g->V[i]=i } /*初始化R*/ for(i=1 i<=n i++) for(j=1 j<
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
ppt-triangel
- 本專題分為3大部份 1. 對單一圖片做邊緣檢測後, 統計其複雜度, 再以 Delaunay 三角網來分割複雜度較高的圖形, 將此圖形之三角網的三點座標與RGP值 取樣後壓縮儲存, 及達成壓縮目的. 還原部份為, 以線性內插則是將取樣後的三角網三點內插後還原之原理, 還原單一影像, 再將所有還原之影像串連撥放即完成之影片還原. 2.讀取RS-232接至RFID門禁系統, 讀取Myfair悠遊卡之卡號, 進行身份辨識後, 可選擇需要觀賞之影片.
neighbours-nodistance
- 输入矩阵及其阶数，通过求该矩阵德尔邻接矩阵求无向图。-The order of the input matrix and by request of the matrix Del undirected graph adjacency matrix.
datastructor
- 基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构-Basic concepts of C++ programming, based on a comprehensive and systematic introduction to the queue, stack, tree, graph, and other basic data structures
tudebianliguochegn
- 图邻接矩阵_邻接表的建立 图的遍历课程设计-_ Adjacency list graph adjacency matrix graph traversal establishment of curriculum design
JAVA
- 创建一个applet，绘制一组图形，并且用户可以指定数目。添加不同类型的GUI组件，可以实现下列选择： A:所画图形的类型：圆、椭圆、矩形、直线 B：颜色：红色、绿色、蓝色、橙色、黄色、青色、红紫色 -Create an applet, draw a graph, and the user can specify the number. Add different types of GUI components, can achieve the following options:
solution_osg
- solution given an overview of scene graph
9
- but the most accurate values can be read in the graph of how the capacitances vary. A graph of this type is also often found in the data sheets [7]. The value of CGC has the largest change and decreases with increasing voltage. Another and prob
dijkstra
- Implementation of dijkstra Alghoritm, Graph Theory.Full source code in C++.
VietGraph1.2
- Very good graph for pc