Searched refs:graph (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp47 int curves(const PixelGraph &graph, PixelGraph::const_iterator a,
68 void operator()(const PixelGraph &graph, unsigned radius);
232 PixelGraph graph(buf);
242 assert(graph.width() > 0);
243 assert(graph.height() > 0);
246 graph.checkConsistency();
255 graph.connectAllNeighbors();
264 graph.checkConsistency();
273 _disconnect_neighbors_with_dissimilar_colors(graph);
283 graph
356 _disconnect_neighbors_with_dissimilar_colors(PixelGraph &graph) argument
434 _remove_crossing_edges_unsafe(PixelGraph &graph, T &edges, const Options &options) argument
506 curves(const PixelGraph &graph, PixelGraph::const_iterator a, PixelGraph::const_iterator b) argument
562 operator ()(const PixelGraph &graph, unsigned radius) argument
[all...]
H A Dkopftracer2011.h126 static void _disconnect_neighbors_with_dissimilar_colors(PixelGraph &graph);
133 static void _remove_crossing_edges_unsafe(PixelGraph &graph, T &edges,
/inkscape/src/libvpsc/
H A Dsolve_VPSC.cpp287 vector<node*> graph; local
290 graph.push_back(u);
304 while(!graph.empty()) {
306 vector<node*>::iterator i=graph.begin();
307 for(;i!=graph.end();++i) {
313 if(i==graph.end() && !graph.empty()) {
317 graph.erase(i);
325 for(unsigned i=0; i<graph.size(); ++i) {
326 delete graph[
334 vector<node*> graph; local
[all...]
/inkscape/src/libdepixelize/priv/
H A Dsimplifiedvoronoi.h65 SimplifiedVoronoi(const PixelGraph &graph);
145 void _complexTopLeft(const PixelGraph &graph,
148 void _complexTopRight(const PixelGraph &graph,
151 void _complexBottomRight(const PixelGraph &graph,
154 void _complexBottomLeft(const PixelGraph &graph,
251 ::SimplifiedVoronoi(const PixelGraph &graph) : argument
252 _width(graph.width()),
253 _height(graph.height()),
254 _cells(graph.size())
256 if (!graph
533 _complexTopLeft(const PixelGraph &graph, PixelGraph::const_iterator graph_it, Cell *const cells_it, int x, int y) argument
555 _complexTopRight(const PixelGraph &graph, PixelGraph::const_iterator graph_it, Cell *const cells_it, int x, int y) argument
577 _complexBottomRight(const PixelGraph &graph, PixelGraph::const_iterator graph_it, Cell *const cells_it, int x, int y) argument
599 _complexBottomLeft(const PixelGraph &graph, PixelGraph::const_iterator graph_it, Cell *const cells_it, int x, int y) argument
[all...]
/inkscape/src/libavoid/
H A Dvpsc.cpp118 vector<node*> graph; local
121 graph.push_back(u);
135 while(!graph.empty()) {
137 vector<node*>::iterator i=graph.begin();
138 for(;i!=graph.end();++i) {
144 if(i==graph.end() && !graph.empty()) {
148 graph.erase(i);
156 for(unsigned i=0; i<graph.size(); ++i) {
157 delete graph[
165 vector<node*> graph; local
[all...]
/inkscape/src/2geom/
H A Dintersection-graph.cpp3 * \brief Intersection graph for Boolean operations
34 #include <2geom/intersection-graph.h>
470 os << "Intersection graph:\n"

Completed in 397 milliseconds