Searched defs:edges (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/libcola/
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 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 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
/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...]

Completed in 20 milliseconds