Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 249) sorted by relevance

12345678910

/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
Dtest_dot.py37 edges = {}
39 edges[head] = {}
41 edges[head][tail] = {}
43 self.assertEqual(dot.edges[1], edges[1])
44 self.assertEqual(dot.edges, edges)
68 edges = {}
70 edges[head] = {}
73 edges[head][tail] = {'label': (head, tail) }
75 self.assertEqual(dot.edges[1], edges[1])
76 self.assertEqual(dot.edges, edges)
[all …]
/external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
Dgraph.rst8 represents a directed graph with *N* nodes and *E* edges.
10 .. class:: Graph([edges])
13 *edges* parameter is supplied, updates the graph by adding the
14 specified edges.
16 All of the elements in *edges* should be tuples with two or three
40 Hides a *node* from the graph. The incoming and outgoing edges of
50 edges of the node are also restored.
83 and incoming edges for the node.
101 Return the list of outgoing edges for *node*
105 Return the list of incoming edges for *node*
[all …]
Dgraphstat.rst13 Groups the number of edges per node into *bin_num* bins
19 the mininum and maximum number of edges that get binned (that
21 and 10 edges get counted.
24 outgoing (``'out'``) edges. The default is to count the outgoing
25 edges.
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
DDot.py137 self.nodes, self.edges = {}, {}
165 if head not in self.edges:
166 self.edges[head] = {}
167 self.edges[head][tail] = {}
195 if node not in self.edges:
196 self.edges[node] = {}
214 if tail not in self.edges[head]:
215 self.edges[head][tail]= {}
216 self.edges[head][tail] = kwargs
247 for head in sorted(self.edges):
[all …]
DGraph.py39 def __init__(self, edges=None): argument
45 self.nodes, self.edges = {}, {}
48 if edges is not None:
49 for item in edges:
116 self.edges[edge] = (head_id, tail_id, edge_data)
127 head_id, tail_id, edge_data = self.hidden_edges[edge] = self.edges[edge]
130 del self.edges[edge]
169 self.edges[edge] = head_id, tail_id, data
202 head, tail, data = self.edges[edge]
228 return len(self.edges)
[all …]
/external/opencv3/modules/cudalegacy/src/cuda/
Dccomponetns.cu208 …void computeEdges(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, c… in computeEdges() argument
216 …ivity<T, Int_t><<<grid, block, 0, stream>>>(static_cast<const PtrStepSz<T> >(image), edges, inInt); in computeEdges()
223 …template void computeEdges<uchar> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
224 …template void computeEdges<uchar3> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
225 …template void computeEdges<uchar4> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
226 …template void computeEdges<ushort> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
227 …template void computeEdges<ushort3>(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
228 …template void computeEdges<ushort4>(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
229 …template void computeEdges<int> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
230 …template void computeEdges<float> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, c…
[all …]
/external/opencv/cvaux/src/
Dcvdpstereo.cpp110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); in icvFindStereoCorrespondenceByBirchfieldDP() local
160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2; in icvFindStereoCorrespondenceByBirchfieldDP()
161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1; in icvFindStereoCorrespondenceByBirchfieldDP()
164 edges[y*imgW+j] = 0; in icvFindStereoCorrespondenceByBirchfieldDP()
169 edges[y*imgW+j] |= 1; in icvFindStereoCorrespondenceByBirchfieldDP()
174 edges[y*imgW+j] |= 2; in icvFindStereoCorrespondenceByBirchfieldDP()
196 uchar* _edges = edges + y*imgW + x; in icvFindStereoCorrespondenceByBirchfieldDP()
329 edges[y*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
330 edges[(y+1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
331 edges[(y-1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
[all …]
Ddecomppoly.cpp328 int* edges,
344 if( edges[ mainEdgeIdx * 2 ] == vtxIdx ) {
347 x0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].x;
348 y0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].y;
359 x0_end = contour[ edges[ mainEdgeIdx * 2 ] ].x;
360 y0_end = contour[ edges[ mainEdgeIdx * 2 ] ].y;
368 ( edges[ i * 2 ] == vtxIdx || edges[ i * 2 + 1 ] == vtxIdx ) )
373 if( edges[ i * 2 ] == vtxIdx ) {
374 x1_left = x1_right = contour[ edges[ i * 2 + 1 ] ].x;
375 y1_left = y1_right = contour[ edges[ i * 2 + 1 ] ].y;
[all …]
/external/opencv3/samples/cpp/tutorial_code/ImgProc/
DMorphology_3.cpp102 Mat edges; in main() local
103 adaptiveThreshold(vertical, edges, 255, CV_ADAPTIVE_THRESH_MEAN_C, THRESH_BINARY, 3, -2); in main()
104 imshow("edges", edges); in main()
108 dilate(edges, edges, kernel); in main()
109 imshow("dilate", edges); in main()
119 smooth.copyTo(vertical, edges); in main()
/external/opencv3/samples/winrt_universal/VideoCaptureXAML/video_capture_xaml/video_capture_xaml.Shared/
Dmain.cpp119 Mat edges; in cvFilterCanny() local
120 cvtColor(frame, edges, COLOR_RGB2GRAY); in cvFilterCanny()
121 GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5); in cvFilterCanny()
122 Canny(edges, edges, 0, 30, 3); in cvFilterCanny()
123 cvtColor(edges, frame, COLOR_GRAY2RGB); in cvFilterCanny()
/external/freetype/src/autofit/
Dafhints.c107 AF_Edge edges; in af_axis_hints_new_edge() local
112 if ( axis->edges == NULL ) in af_axis_hints_new_edge()
114 axis->edges = axis->embedded.edges; in af_axis_hints_new_edge()
135 if ( axis->edges == axis->embedded.edges ) in af_axis_hints_new_edge()
137 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in af_axis_hints_new_edge()
139 ft_memcpy( axis->edges, axis->embedded.edges, in af_axis_hints_new_edge()
140 sizeof ( axis->embedded.edges ) ); in af_axis_hints_new_edge()
144 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
151 edges = axis->edges; in af_axis_hints_new_edge()
152 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
[all …]
Daflatin.c1596 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges()
1667 AF_Edge edges = axis->edges; in af_latin_hints_compute_edges() local
1668 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hints_compute_edges()
1672 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1685 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1834 AF_Edge edge = axis->edges; in af_latin_hints_compute_blue_edges()
2261 stem_edge - hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin_align_linked_edge()
2298 AF_Edge edges = axis->edges; in af_latin_hint_edges() local
2299 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hint_edges()
2319 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hint_edges()
[all …]
Daflatin2.c1160 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges()
1230 AF_Edge edges = axis->edges; in af_latin2_hints_compute_edges() local
1231 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hints_compute_edges()
1235 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1248 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1390 AF_Edge edge = axis->edges; in af_latin2_hints_compute_blue_edges()
1809 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin2_align_linked_edge()
1841 AF_Edge edges = axis->edges; in af_latin2_hint_edges() local
1842 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hint_edges()
1858 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hint_edges()
[all …]
Dafcjk.c962 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges()
1064 AF_Edge edges = axis->edges; in af_cjk_hints_compute_edges() local
1065 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hints_compute_edges()
1069 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1082 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1199 AF_Edge edge = axis->edges; in af_cjk_hints_compute_blue_edges()
1548 stem_edge - hints->axis[dim].edges, stem_edge->fpos, in af_cjk_align_linked_edge()
1717 AF_Edge edges = axis->edges; in af_cjk_hint_edges() local
1718 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hint_edges()
1740 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hint_edges()
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
DGraph.java40 List<Node> edges; // points at which nodes? field in Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>(); in addEdge()
46 if ( !edges.contains(n) ) edges.add(n); in addEdge()
99 if ( n.edges!=null ) { in DFS()
100 for (Iterator it = n.edges.iterator(); it.hasNext();) { in DFS()
/external/opencv3/modules/cudaimgproc/src/
Dmssegmentation.cpp96 std::vector<Edge> edges; member in __anon3fe692990111::Graph
182 Graph<T>::Graph(int numv_, int nume_max_) : start(numv_, -1), edges(nume_max_) in Graph()
193 edges[nume] = Edge(to, start[from], val); in addEdge()
321 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next) in meanShiftSegmentation()
324 int c2 = comps.find(g.edges[e_it].to); in meanShiftSegmentation()
325 if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp) in meanShiftSegmentation()
330 std::vector<SegmLink> edges; in meanShiftSegmentation() local
331 edges.reserve(g.numv); in meanShiftSegmentation()
337 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next) in meanShiftSegmentation()
339 int c2 = comps.find(g.edges[e_it].to); in meanShiftSegmentation()
[all …]
Dgeneralized_hough.cpp61 …int buildEdgePointList_gpu(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList…
110 void setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter);
113 …void detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray positions, OutputArray…
115 void buildEdgePointList(const GpuMat& edges, const GpuMat& dx, const GpuMat& dy);
144 void calcEdges(InputArray src, GpuMat& edges, GpuMat& dx, GpuMat& dy);
180 void GeneralizedHoughBase::calcEdges(InputArray _src, GpuMat& edges, GpuMat& dx, GpuMat& dy) in calcEdges() argument
193 ensureSizeIsEnough(src.size(), CV_8UC1, edges); in calcEdges()
197 canny_->detect(dx, dy, edges); in calcEdges()
220 …void GeneralizedHoughBase::setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point t… in setTemplateImpl() argument
222 edges.getGpuMat().copyTo(templEdges_); in setTemplateImpl()
[all …]
Dcanny.cpp79 void detect(InputArray image, OutputArray edges, Stream& stream);
80 void detect(InputArray dx, InputArray dy, OutputArray edges, Stream& stream);
114 void CannyCaller(GpuMat& edges, Stream& stream);
144 GpuMat edges = _edges.getGpuMat(); in detect() local
167 CannyCaller(edges, stream); in detect()
188 GpuMat edges = _edges.getGpuMat(); in detect() local
192 CannyCaller(edges, stream); in detect()
218 void CannyImpl::CannyCaller(GpuMat& edges, Stream& stream) in CannyCaller() argument
227 canny::getEdges(map_, edges, StreamAccessor::getStream(stream)); in CannyCaller()
/external/skia/src/gpu/effects/
DGrConvexPolyEffect.cpp254 SkScalar edges[3 * kMaxEdges]; in Create() local
273 edges[3 * n] = v.fY; in Create()
274 edges[3 * n + 1] = -v.fX; in Create()
276 edges[3 * n] = -v.fY; in Create()
277 edges[3 * n + 1] = v.fX; in Create()
280 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[3 * n + 1] * p.fY); in Create()
287 return Create(type, n, edges); in Create()
312 GrConvexPolyEffect::GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) in GrConvexPolyEffect() argument
318 memcpy(fEdges, edges, 3 * n * sizeof(SkScalar)); in GrConvexPolyEffect()
340 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
[all …]
/external/skia/samplecode/
DSamplePathClip.cpp78 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) {
79 SkPoint* edgesStart = edges;
112 *edges++ = p0;
113 *edges++ = p1;
118 *edges++ = p0;
119 *edges++ = p1;
125 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
126 *edges++ = SkPoint::Make(bounds.left(), y);
131 *edges++ = p0;
132 *edges++ = SkPoint::Make(bounds.right(), y);
[all …]
/external/opencv3/doc/py_tutorials/py_imgproc/py_canny/
Dpy_canny.markdown34 Gradient direction is always perpendicular to edges. It is rounded to one of four angles
49 In short, the result you get is a binary image with "thin edges".
53 This stage decides which are all edges are really edges and which are not. For this, we need two
54 …threshold values, minVal and maxVal. Any edges with intensity gradient more than maxVal are sure to
55 …be edges and those below minVal are sure to be non-edges, so discarded. Those who lie between these
56 …two thresholds are classified edges or non-edges based on their connectivity. If they are connected
57 …to "sure-edge" pixels, they are considered to be part of edges. Otherwise, they are also discarded.
68 This stage also removes small pixels noises on the assumption that edges are long lines.
70 So what we finally get is strong edges in the image.
87 edges = cv2.Canny(img,100,200)
[all …]
/external/opencv3/samples/cpp/tutorial_code/ImgTrans/
DHoughLines_Demo.cpp19 Mat src, edges; variable
53 Canny( src_gray, edges, 50, 200, 3 ); in main()
89 cvtColor( edges, standard_hough, COLOR_GRAY2BGR ); in Standard_Hough()
92 HoughLines( edges, s_lines, 1, CV_PI/180, min_threshold + s_trackbar, 0, 0 ); in Standard_Hough()
116 cvtColor( edges, probabilistic_hough, COLOR_GRAY2BGR ); in Probabilistic_Hough()
119 HoughLinesP( edges, p_lines, 1, CV_PI/180, min_threshold + p_trackbar, 30, 10 ); in Probabilistic_Hough()
/external/opencv3/modules/imgproc/src/
Dgeneralized_hough.cpp69 void setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter);
72 …void detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray positions, OutputArray…
97 void calcEdges(InputArray src, Mat& edges, Mat& dx, Mat& dy);
110 void GeneralizedHoughBase::calcEdges(InputArray _src, Mat& edges, Mat& dx, Mat& dy) in calcEdges() argument
117 Canny(src, edges, cannyLowThresh_, cannyHighThresh_); in calcEdges()
135 …void GeneralizedHoughBase::setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point t… in setTemplateImpl() argument
137 edges.getMat().copyTo(templEdges_); in setTemplateImpl()
179 …void GeneralizedHoughBase::detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray … in detectImpl() argument
181 edges.getMat().copyTo(imageEdges_); in detectImpl()
335 …void setTemplate(InputArray edges, InputArray dx, InputArray dy, Point templCenter) { setTemplateI… in setTemplate() argument
[all …]
/external/guice/extensions/grapher/test/com/google/inject/grapher/
DAbstractInjectorGrapherTest.java49 final Set<Edge> edges = Sets.newHashSet(); field in AbstractInjectorGrapherTest.FakeGrapher
53 edges.clear(); in reset()
72 assertFalse(edges.contains(edge)); in newDependencyEdge()
73 edges.add(edge); in newDependencyEdge()
77 assertFalse(edges.contains(edge)); in newBindingEdge()
78 edges.add(edge); in newBindingEdge()
141 assertEquals(expectedEdges, grapher.edges); in testLinkedAndInstanceBindings()
166 assertEquals("wrong edges", expectedEdges, grapher.edges); in testProviderBindings()
182 assertEquals(expectedEdges, grapher.edges); in testGraphWithGivenRoot()
/external/opencv3/modules/imgproc/perf/
Dperf_canny.cpp30 Mat edges(img.size(), img.type()); variable
32 declare.in(img).out(edges);
34 TEST_CYCLE() Canny(img, edges, thresh_low, thresh_high, aperture, useL2);
36 SANITY_CHECK(edges);

12345678910