//Name, Matrikelnummer #include using namespace leda; GRAPH G; void run_topsort(GraphWin& gw) { bool azykl = true; // ... hier soll der Algorithmus implementiert werden if(azykl) gw.set_node_label_type(data_label); else gw.set_node_label_type(no_label); gw.redraw(); } void new_node_handler(GraphWin& gw, node v) { run_topsort(gw); } void new_edge_handler(GraphWin& gw, edge e) { run_topsort(gw); } int main() { GraphWin gw(G); gw.set_node_label_type(no_label); gw.set_init_graph_handler(run_topsort); gw.set_new_node_handler(new_node_handler); gw.set_new_edge_handler(new_edge_handler); gw.set_del_edge_handler(run_topsort); gw.set_del_node_handler(run_topsort); gw.display(); gw.edit(); return 0; }