All releases of GOBLIN Graph Library

  •  29 Jul 2007 23:35
Avatar

    Release Notes: This release comes with explicit code for orthogonal drawing of trees. There are also new generator methods for regular planar graphs. A lot of Doxygen comments have been added, but descriptions are still far from complete.

    •  26 May 2007 10:39
    Avatar

      Release Notes: This release adds several fixes for bugs which have been revealed by the current efforts at test automation. Most fixes concern the graph drawing functionalities.

      •  01 May 2007 00:01
      Avatar

        Release Notes: A GraphViz dot export has been added. This release also comes up with a cleanup of the planarity and layout codes. The display of nodes and arrowheads has been improved.

        •  17 Mar 2007 14:06
        Avatar

          Release Notes: This release comes with several code cleanups and fixes for documentation issues. One important change concerns the doxygen comments, which are now complete on file and class level.

          •  22 Jan 2007 21:25
          Avatar

            Release Notes: The Kandinski drawing code has been extended with some starting heuristics. It can now be used interactively. Several bugs in the GUI and the drawing code have been fixed.

            •  26 Dec 2006 22:57
            Avatar

              Release Notes: The compaction code for orthogonal drawing has been substantially improved, both for the 4-orthogonal model and the Kandinski model.

              •  12 Nov 2006 07:15
              Avatar

                Release Notes: The orthogonal drawing methods have been extended by some basic layout compaction rules.

                •  25 Oct 2006 20:59
                Avatar

                  Release Notes: All network flow methods are now applicable to undirected graphs. The so-called staircase algorithm has been implemented for planar orthogonal layout.

                  •  22 Sep 2006 19:05
                  Avatar

                    Release Notes: All graph internal, array-like data structures have been replaced by special objects (attributes) that depend on STL vectors. Such objects can be accessed from outside of the graph objects now. The graph loader has been rewritten so that no special order of attributes is required any longer. Both the file and the internal representation have become much more extensible.

                    •  30 Jul 2006 06:23
                    Avatar

                      Release Notes: The layered drawing code has been refined with respect to undirected graphs. The layering is obtained from a bipolar orientation, and this orientation can be computed for arbitrary node pairs now.

                      Screenshot

                      Project Spotlight

                      episoder

                      A tool to tell you about new episodes of your favourite TV shows.

                      Screenshot

                      Project Spotlight

                      BalanceNG

                      A modern software IP load balancer.