搜索资源列表
EULER1
- Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为
QQFram
- 这是一个可以吸附在屏幕边缘的窗口 就像QQ一样靠近屏幕边缘时，会吸进屏幕边缘，隐藏起来-This is a screen can be adsorbed on the edge of the window like QQ near the same screen edge, inhale the screen's edges, hidden
fly123diao
- /* To wrap edges seamlessly, copy edge values around to other side of array */ if (i==0) fa[(subSize*size) + j] = fa[(i * size) + j] if (j==0) fa[(i*size) + subSize] = fa[(i * size) + j] j+=stride -/ * To wrap edges seam
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
CHISEL
- Clipper锯齿边缘阴影框的设计-Clipper jagged edges of the shadow box design
ATLCreateActiveXCtrl
- 如何用ATL创建ActiveX控件 实现了一个ActiveX控件,它在一个圆内部有个正多边形,当用户在多变形内部单击将会使多边形的边数在当前的基础上+1,在多变形外部单击将会使多边形的边数在当前的基础上-1,并能改变多边形的颜色.最后举了两个例子说明了如何使用这个刚刚生产得控件.一个是把该控件应用到网页中,一个则是用于一个基于对话框的程序中.详细代码请下载压缩包.-how to use ActiveX to create an ActiveX control, it is an internal
analysis.rar
- 一个计算网络特征量的，计算网络的介数，边数，核数的程序。,Features of a computing network, the computing network of referrals the number of edges, auditing procedures.
LectureHalls.rar
- acm算法设计—会场安排问题！ 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。) 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。,acm algorithm design- the venue arrangements! Assume it to be enough room
ChonSu
- 已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right n
enum_nt_services
- 列出NT的所有服务-the edges of image feature extraction and contour tracking, and high is your fault
TransparentButtonDemo
- Bob Carboni写的使用透明度、抗锯齿波、窗口区域等技术的按钮控件。Transparent Button with Region and Anti-Aliased Edges-Bob Carboni was the use of transparency, anti-aliasing wave technologies such as the window region of the button control. Transparent Button with Region and An
2
- 设计一个三角形类，包含表示三条边的数据成员，编程实现求两个三角形面积之和。-The design of a triangle, are contained, said three edges of the data members, programming for area and two triangles.
graph
- 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-Map a series of nature, by entering the graph nodes and edges, the output map of various matrices, and to determine whether it was connected graph chart, such as the nature of the Euler diagram.
moving_average_v3.1
- Smooths a matrix (with/without NaN s) via recursive moving average method and eliminates data gaps. -MOVING_AVERAGE(X,F) smooths the vector data X with a boxcar window of size 2F+1, i.e., by means of averaging each element with the F elements at hi
ShortestPaths
- Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
ShortestPathsEdge
- In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh
EdgeDisjointCycles
- Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the ed
EDGE_LAPLASS
- This program is used to detect the edges of the image using Laplass method.
grs2rgb
- Extract the edges information
DetectEdg
- Detect edges by Gradiend