3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
24 #include <all_include.h>
25 #include <libgnomecanvasmm.h>
26 #include <libgnomecanvasmm/polygon.h>
28 ///Graphical interface to run Dijkstra algorithm.
30 ///Child of \ref AlgoBox,
31 ///therefore the only task to do at implementation was to
33 ///-call init function with correct parameters from correctly parametrized constructor
35 ///-implement \ref build_box function
37 ///-implement \ref run function
38 class DijkstraBox : public AlgoBox
41 ///Shows result of Dijkstra algorithm
42 Gtk::Label resultlabel;
45 ///Table for nodeselector widgets
48 ///Combobox for select source node
49 Gtk::ComboBoxText source;
51 ///Combobox for select target node
52 Gtk::ComboBoxText target;
54 ///Gets to and from node from combobox
55 void get_from_to(Node &, Node &, Graph &);
58 ///Calls \ref AlgoBox::init function to initialize class properly, automatically.
59 DijkstraBox(std::vector<std::string> t);
61 ///Prepare, run and postprocess Dijkstra algorithm.
63 ///\ref glemon works only with maps filled with double values
64 ///at the moment. While Dijkstra nedds a bool map as output.
65 ///As postprocess this bool map should be transformed to
69 ///Builds the graphical design of the interface.
70 virtual void build_box();
72 void maplists_updated();
75 class SuurballeBox : public DijkstraBox
77 ///number of paths to find
80 ///Widget to set numbewr of paths to find
81 Gtk::SpinButton * num_set;
87 SuurballeBox(std::vector<std::string> t);
91 #endif //DIJKSTRABOX_H