搜索资源列表
toci
- Complex networks have some common basic model, such as random graph, WS small-world networks, NW small-world networks and scale-free BA network, the program generated from the mechanism of these networks to generate the complex network model and anal
tulunkeshe
- 图论课程设计 二部图 欧拉回路 呈上分享 希望有帮助-Graph theory, curriculum design, bipartite graph Euler circuit brought to share the hope that help
dijkstra
- this program shortpathes node using graph for decide short distance in networking
graph
- 本程序描述图的算法的表述，可以通过该程序学习图的程序设计-This procedure describes the graph algorithm representation, you can learn through the process of program design plan
main
- Descr iption: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字
Graph-cut
- 计算机图形学实验 图形裁剪 C++ 完整程序-Computer Graphics graphics clipping experiment a complete C++ program
431465_b5876716cac6a624
- 基于QQ2440 ARM开发板的实时绘制曲线图的QT程序，从ARM板上的串口接收数据后，绘制曲线图形，然后利用网口将数据传输到PC机上。-QQ2440 ARM development board based on real-time rendering curve of the QT program, from the ARM-board serial port to receive data, draw curve graph, then use the Ethernet port to tr
testSeg1
- Effcient Graph-Based Image Segmentation算法的源码， 已通过测试， 可以使用-the source data of the algoritham Effcient Graph-Based Image Segmentation
Graph
- 图形编辑器用VC6.0中的MFC实现简单的图形编辑，包括画圆、画直线、画矩形等。-Used for VC6.0 graphics editor in MFC to achieve a simple graphics editor, including the Circle, painting a straight line and draw a rectangle and so on.
A-Literature-Review-of-Image-Segmentation
- This literature review attempts to provide a brief overview of some of the most common segmentation techniques, and a comparison between them. It discusses the “Grab-Cut” technique, and reviews some some of the common matting techniques. The graph cu
59tt460Grtyt
- 割图的算法，国际上正流行的图像分割方法，希望对大家有帮助-Cut graph algorithms, the international community is a popular image segmentation method, we want to help
graph
- 数据结构实验：用C语言求解图的深度遍历和广度遍历-Experimental data structures: Using C language to solve graph traversal depth and breadth of the traverse
Graph
- 1．建立无向网的邻接矩阵。 要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。 2．对无向网进行深度优先遍历，输出遍历序列。 3.判断给定的无向网是否是连通的？ 要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke
graph
- 运用VC++ 编写的图的邻接矩阵存储和邻接表存储，并对图进行遍历-it is the storage of the graph
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output
id3
- For now, we are not interested in what this graph represents. Rather, we would like to "save" the classification results from which the graph is generated. In the new window, we click on the "Save" button and save the result as the file: "bank-predic
Plot_a_graph
- Visual Basic code to plot a Graph. It is very simple and easy.
OLEAuto
- MS Office Automation using C++” - this what I started searching over the internet a few weeks back to plot a graph in an Excel sheet through my program. Fortunately, I got a few - actually very few - inputs from the cyber world, might be because I am
xgraph
- X Graph utility of ns 2
Graph
- 用C++实现的图论的一些程序，还很实用。包括了：搜索树等一系列算法-C++, graph theory to achieve some of the procedures, still useful. Includes: a series of search tree algorithm