IGLU's next meeting is Friday May 5th in Compaq, Raanana. we'll listen to a Gnome/GTK lecture by Moshe Zadka, as usual after the lecture we'll discuss IGLU matters and news, like trips to the north, website rewrite and installation parties. IMPORTANT: If you intend to come, please RSVP to [EMAIL PROTECTED] Gtk+/GNOME is a GUI toolkit written in C, which is becoming the defacto standard in the GNU/Linux work, with support from companies such as Red Hat, Eazel and Helixcode. The toolkit is written in C, but has bindings to all major programming languages, including Perl, Python, C++ and Scheme. I will talk about the parts of Gtk+ (glib, Gdk and Gtk), and about some of the parts of GNOME (including libgnome and libgnomeui, possibly libvfs, but excluding gnorba and bonobo). I will try to illustrate the design, purpose, and in some interesting cases, the implementations. If I have further time, I would like to speak about pygtk and pygnome, the bindings to Python, to illustrate the underlying OO design. To fully understand the lecture, it is recommended to know at least one programming language, and to understand some of the technical implementation nits (which are cute enough) it is recommended to know C at a high enough level to understand pointer casts. Please mail me ([EMAIL PROTECTED]) if you have any questions, or suggestions. Where and when:: The meeting will take place this month at Compaq, 9 Dafna St., Ind. Center Ranana (NOT the IDC as last time!). Again we will gather at around 9am, with the lecture starting 30-60 minutes after that. directions: >From Geha coming from south, you reach north. Ranana Junction, Turn left into Weizman First turn right into Industrial center. Keep going and follow Compaq sign till you see Compaq building on left. Turn left till you reach car park. By bus, Once you reach main street (Ahuza) in Ranana Take #4 bus till Rananim shopping center. Compaq building can be seen from the shopping center. -- Chen Shapira Web Developer and Linux Activist The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*.
