Empty graph is (strongly) connected.
1 #include "graph_displayer_canvas.h"
2 #include "broken_edge.h"
5 void GraphDisplayerCanvas::zoomIn()
8 (1.0 + (double) zoom_step / 100.0) * get_pixels_per_unit());
11 void GraphDisplayerCanvas::zoomOut()
14 (1.0 - (double) zoom_step / 100.0) * get_pixels_per_unit());
17 void GraphDisplayerCanvas::zoomFit()
21 // get the height and width of the canvas
22 Gtk::Allocation a = get_allocation();
23 int aw = a.get_width();
24 int ah = a.get_height();
26 // get the bounding box of the graph
28 double x1, y1, x2, y2;
29 root()->get_bounds(x1, y1, x2, y2);
31 // fit the graph to the window
32 double ppu1 = (double) aw / fabs(x2 - x1);
33 double ppu2 = (double) ah / fabs(y2 - y1);
34 set_pixels_per_unit((ppu1 < ppu2) ? ppu1 : ppu2);
37 void GraphDisplayerCanvas::zoom100()
40 set_pixels_per_unit(1.0);
43 void GraphDisplayerCanvas::updateScrollRegion()
45 // get_bounds() yields something sane only when no updates are pending
46 // and it returns a sufficient, not an exact bounding box
48 double x1, y1, x2, y2;
49 root()->get_bounds(x1, y1, x2, y2);
50 set_scroll_region(x1, y1, x2, y2);