#include using namespace leda; GRAPH G; void run_kruskal(GraphWin& gw) { //... //_____________________________________________________ gw.redraw(); return; } void init_edge(GraphWin& gw, edge e) { G[e] = rand_int(-99,99); gw.set_slider_value(e,(G[e]+100)/200.0,0); } void new_node_handler(GraphWin& gw, node v) { run_kruskal(gw); } void new_edge_handler(GraphWin& gw, edge e) { init_edge(gw,e); run_kruskal(gw); } void del_node_handler(GraphWin& gw) { run_kruskal(gw); } void del_edge_handler(GraphWin& gw) { run_kruskal(gw); } void init_handler(GraphWin& gw) { edge e; forall_edges(e,G) init_edge(gw,e); } void edge_slider_handler(GraphWin& gw,edge e, double f) { G[e] = int(200*f-100); run_kruskal(gw); } int main() { GraphWin gw(G,"Algorithmus von Kruskal"); gw.set_edge_label_type(data_label); gw.set_edge_direction(undirected_edge); gw.set_init_graph_handler(init_handler); gw.set_new_node_handler(new_node_handler); gw.set_new_edge_handler(new_edge_handler); gw.set_del_edge_handler(del_edge_handler); gw.set_del_node_handler(del_node_handler); gw.set_edge_slider_handler(edge_slider_handler); gw.display(); gw.edit(); return 0; }