Searched refs:edges (Results 1 - 17 of 17) sorted by relevance

/inkscape/src/libcola/
H A Dcycle_detector.h29 CycleDetector(unsigned numVertices, Edges *edges);
32 void mod_graph(unsigned numVertices, Edges *edges);
34 Edges *getEdges() { return this->edges; }
39 Edges *edges; member in class:CycleDetector
43 std::vector<bool> *cyclicEdgesMapping; // the cyclic edges in the graph.
H A Dcycle_detector.cpp2 * edges involved in cycles in a digraph.
21 CycleDetector::CycleDetector(unsigned numVertices, Edges *edges) { argument
23 this->edges = edges;
55 // from the edges passed, fill the adjacency matrix
56 for (ei = edges->begin(); ei != edges->end(); ++ei) {
108 cyclicEdgesMapping = new vector<bool>(edges->size(), false);
111 assert(!edges->empty());
158 void CycleDetector::mod_graph(unsigned numVertices, Edges *edges) { argument
[all...]
H A Ddefs.h30 int *edges; member in struct:vtx_data
94 int *edges; /* edges[0..(nedges-1)] are neighbors; edges[0] is self */ member in struct:__anon100
H A Dstraightener.cpp199 void generateConstraints(vector<Node*>& nodes, vector<Edge*>& edges,vector<SimpleConstraint*>& cs,Dim dim) { argument
200 unsigned nevents=2*nodes.size()+2*edges.size();
211 for(unsigned i=0;i<edges.size();i++) {
212 Edge *e=edges[i];
224 for(unsigned i=0;i<edges.size();i++) {
225 Edge *e=edges[i];
262 // Case A: create constraints between adjacent edges skipping edges joined
283 // Case B: create constraints for all the edges connected to the right of
H A Dcola.h24 // for the nodes in this component, and a list of edges - node indices relative to this component
29 std::vector<Edge> edges; member in class:cola::Component
H A Dconnected_components.cpp95 u.first->edges.push_back(make_pair(u.second,v.second));
H A Dstraightener.h129 void generateConstraints(std::vector<Node*>& nodes, std::vector<Edge*>& edges, std::vector<SimpleConstraint*>& cs, Dim dim);
/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp294 PixelGraph::EdgePairContainer edges = graph.crossingEdges(); local
303 _remove_crossing_edges_safe(edges);
321 _remove_crossing_edges_unsafe(graph, edges, options);
391 * This method removes crossing edges if the 2x2 block is fully connected.
431 * This method removes crossing edges using the heuristics.
434 void Kopf2011::_remove_crossing_edges_unsafe(PixelGraph &graph, T &edges, argument
437 std::vector< std::pair<int, int> > weights(edges.size(),
441 for ( typename T::size_type i = 0 ; i != edges.size() ; ++i ) {
445 PixelGraph::iterator a = edges[i].first.first;
446 PixelGraph::iterator b = edges[
[all...]
H A Dkopftracer2011.h133 static void _remove_crossing_edges_unsafe(PixelGraph &graph, T &edges,
/inkscape/share/extensions/
H A Dguides_creator.py74 def drawVerticalGuides(division,w,h,edges,parent,vertical_shift=0):
76 if (edges):
88 def drawHorizontalGuides(division,w,h,edges,parent,horizontal_shift=0):
90 if (edges):
173 help = 'Start from edges')
263 help = 'Start from edges')
303 # getting edges coordinates
H A Dpolyhedron_3d.py176 draw_SVG_line(pt_1,pt_2,st, name, parent)#plot edges
305 edges = len(face_list[i]) #number of edges around that face
306 for j in range(edges):#for every vertex in that face
307 new_edge = [face_list[i][j], face_list[i][(j+1)%edges] ]
325 #edges can be generated from this information
523 else:#we cannot generate a list of faces from the edges without a lot of computation
H A Dvoronoi2svg.py114 #record intersections of the line with bounding box edges
336 vertices,lines,edges = voronoi.computeVoronoiDiagram(pts)
337 for edge in edges:
H A Dgenerate_voronoi.py153 for edge in c.edges:
H A Dvoronoi.py85 # (3) a list of 3-tuples, (l, v1, v2) representing edges of the
112 self.edges = [] # edge 3-tuple: (line index, vertex 1 index, vertex 2 index) if either vertex index is -1, the edge extends to infiinity
167 self.edges.append((edge.edgenum,sitenumL,sitenumR))
510 # if the two edges bisect the same parent return None
735 (3) a list of 3-tuples, (l, v1, v2) representing edges of the
743 return (context.vertices,context.lines,context.edges)
H A Dgcodetools.py2888 # Create the dictionary containing all edges in both directions
2889 edges = {}
2895 for p in edges :
2905 edges[s] = [ [s,e,l] ]
2906 edges[e] = [ [e,s,l] ]
2910 if e in edges :
2911 for edge in edges[e] :
2915 edges[e] += [ [e,s,l] ]
2919 edges[e] = [ [e,s,l] ]
2921 if s in edges
[all...]
/inkscape/src/
H A Dgraphlayout.cpp213 if(c->edges.size()<2) continue;
215 ConstrainedMajorizationLayout alg(c->rects,c->edges,eweights,ideal_connector_length,test);
/inkscape/src/livarot/
H A DShape.h39 * removes all problems a polygon can present: duplicate points or edges, self-intersection. you end up with a
46 shape_graph = 0, // it's just a graph; a bunch of edges, maybe intersections
47 shape_polygon = 1, // a polygon: intersection-free, edges oriented so that the inside is on their left
72 { // info for edges, treated as approximation of edges of the voronoi diagram
126 // -reset the graph, and ensure there's room for n points and m edges
138 // -edges:
149 void SwapEdges(int a, int b); // swaps 2 edges
150 void SwapEdges(int a, int b, int c); // swaps 3 edges
151 void SortEdges(); // sort the edges i
[all...]

Completed in 52 milliseconds