码迷,mamicode.com
首页 >  
搜索关键字:edges    ( 333个结果
OpenCV Tutorials —— Canny Edge Detector
最好的边缘检测子 Canny algorithm aims to satisfy three main criteria: Low error rate: Meaning a good detection of only existent edges. Good localization: The ...
分类:其他好文   时间:2014-11-19 00:02:06    阅读次数:256
深度优先搜索
//深度优先搜索 从一条路径的起始顶点开始追溯到达最后一个顶点,然后回溯继续追溯下一条路径,直到最后一个顶点,如此N次,直到没有路径为止。//创建图function Graph(v) { this.vertices = v; this.edges = 0; this.adj = []; for (v...
分类:其他好文   时间:2014-11-13 14:30:09    阅读次数:179
POJ 1987 BZOJ 3365 Distance Statistics 树的分治(点分治)
题目大意:(同poj1741,刷一赠一系列) CODE: #include #include #include #include #define MAX 20010 #define INF 0x3f3f3f3f using namespace std; int points,edges,k; int head[MAX],total; int next[MAX << 1...
分类:其他好文   时间:2014-10-11 19:19:56    阅读次数:174
SPOJ QTREE 375. Query on a tree
SPOJ Problem Set (classical) 375. Query on a tree Problem code: QTREE You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We wi...
分类:其他好文   时间:2014-10-02 12:56:22    阅读次数:232
HDU Tree LCA 2014 ACM/ICPC Asia Regional Shanghai Online
题意: 给定n个点的树,m个操作 树有点权和边权 下面n-1行给出树边 下面m行操作 : ● ADD1 u v k: for nodes on the path from u to v, the value of these nodes increase by k. ● ADD2 u v k: for edges on the path from u to v, the value...
分类:其他好文   时间:2014-09-27 20:30:00    阅读次数:202
spoj Query on a tree(树链剖分模板题)
375. Query on a tree Problem code: QTREE You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom ...
分类:其他好文   时间:2014-09-16 16:00:20    阅读次数:312
dijkstra
#define maxSize 10//节点类型class VNode{public: int no; char info;};//图类型class MGraph{public: float edges[maxSize][maxSize];//float表示权值 int n,e; VNode vex...
分类:其他好文   时间:2014-09-14 16:42:17    阅读次数:213
Autoencoders and Sparsity(二)
In this problem set, you will implement the sparse autoencoder algorithm, and show how it discovers that edges are a good representation for natural i...
分类:其他好文   时间:2014-09-14 16:33:07    阅读次数:185
UVA - 12163 Addition-Subtraction Game (博弈)
Description   You and your friend are playing a 2 player game. The game is played in a graph of V vertices. The vertices are numbered from 0 to V-1. The graph has some directed edges. But the gr...
分类:其他好文   时间:2014-08-29 01:26:06    阅读次数:305
[POJ 1308]Is It A Tree?(并查集判断图是否为一棵有根树)
Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following proper...
分类:其他好文   时间:2014-08-23 17:46:41    阅读次数:218
333条   上一页 1 ... 30 31 32 33 34 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!